Mod-07 Lec-36 NP - COMPLETE PROBLEMS , COOK'S THEOREM Mod-07 Lec-36 NP - COMPLETE PROBLEMS , COOK'S THEOREM begin-post-stats nptelhrd • 38K views end-post-stats begin-duration 1:10:06 end-duration Math topics: _Mathematical_analysis_##Mathematical analysis##_Iterated_logarithm_##Iterated logarithm##_NP-completeness_##NP-completeness##_Polynomial_##Polynomial##_Theoretical_computer_science_##Theoretical computer science##_Formal_language_##Formal language##_Time_complexity_##Time complexity##_Polynomial-time_reduction_##Polynomial-time reduction##_Elementary_arithmetic_##Elementary arithmetic##_Binary_number_##Binary number##_Plus_and_minus_signs_##Plus and minus signs##_Decimal_##Decimal Other topics: _Alan_turing_##Alan turing##_Non-deterministic_Turing_machine_##Non-deterministic Turing machine##_Turing_machine_##Turing machine##_Alan_Turing_##Alan Turing##_Complexity_classes_##Complexity classes##_PSPACE-complete_##PSPACE-complete##_L_(complexity)_##L (complexity)##_NP_(complexity)_##NP (complexity)##_NP-hardness_##NP-hardness##_P_(complexity)_##P (complexity)##_Mathematical_logic_##Mathematical logic##_Boolean_expression_##Boolean expression##_Reduction_(complexity)_##Reduction (complexity)##_Algorithm_##Algorithm video-id: qpCvPS-WwGA channel_nptelhrd_ So What Learning Alan turing , Complexity classes , Elementary arithmetic , Mathematical analysis , Mathematical logic , Theoretical computer science Saturday, January 20, 2018 Share Share