L20: P, NP and Polynomial-Time Reductions L20: P, NP and Polynomial-Time Reductions begin-post-stats UCDavis • 11K views end-post-stats begin-duration 32:47 end-duration Math topics: _Algebra_##Algebra##_Lattice_(order)_##Lattice (order)##_Integer_##Integer##_Polynomial_##Polynomial Other topics: _Alan_turing_##Alan turing##_Alan_Turing_##Alan Turing##_Non-deterministic_Turing_machine_##Non-deterministic Turing machine##_Turing_machine_##Turing machine##_Analysis_of_algorithms_##Analysis of algorithms##_Algorithmic_efficiency_##Algorithmic efficiency##_Analysis_of_algorithms_##Analysis of algorithms##_Best,_worst_and_average_case_##Best, worst and average case##_Time_complexity_##Time complexity##_Complexity_classes_##Complexity classes##_NTIME_##NTIME##_NP_(complexity)_##NP (complexity)##_DTIME_##DTIME video-id: f7BvvtG9rsY channel_UCDavis_ So What Learning Alan turing , Algebra , Analysis of algorithms , Complexity classes Sunday, January 21, 2018 Share Share
