P vs. NP and the Computational Complexity Zoo P vs. NP and the Computational Complexity Zoo begin-post-stats hackerdashery • 1M views end-post-stats begin-duration 10:44 end-duration Math topics: _Mathematical_analysis_##Mathematical analysis##_NP-completeness_##NP-completeness##_Exponentiation_##Exponentiation##_Polynomial_##Polynomial Other topics: _Complexity_classes_##Complexity classes##_Exponential_hierarchy_##Exponential hierarchy##_BPP_(complexity)_##BPP (complexity)##_NP_(complexity)_##NP (complexity)##_Co-NP_##Co-NP##_PSPACE_##PSPACE##_NP-hardness_##NP-hardness##_EXPTIME_##EXPTIME##_Computational_fields_of_study_##Computational fields of study##_Computational_complexity_theory_##Computational complexity theory##_Time_complexity_##Time complexity##_Problem_solving_##Problem solving##_Computational_complexity_theory_##Computational complexity theory##_Quantum_computing_##Quantum computing##_BQP_##BQP##_Complexity_class_##Complexity class video-id: YX40hbAHx3s channel_hackerdashery_ So What Learning Complexity classes , Computational complexity theory , Computational fields of study , Mathematical analysis Friday, January 12, 2018 Share Share
