The Formal Definition of P (P vs NP)
Let’s take a deeper look at the complexity class P, and decision problems.
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Elaine Chang, Zachary Greenberg, Alex Egan
Twitter: https://twitter.com/UBehavior
—
P vs NP Playlist: https://www.youtube.com/playlist?list=PLlwsleWT767dnN25K_QgvdKkovK_t4K6-
Decision vs Search: https://cseweb.ucsd.edu/~mihir/cse200/decision-search.pdf
The Complexity of Decision versus Search: https://cseweb.ucsd.edu/~mihir/papers/compip.pdf
P (Wiki): https://en.wikipedia.org/wiki/P_(complexity)
Decision Problem (Wiki): https://en.wikipedia.org/wiki/Decision_problem
Reduction (Wiki): https://en.wikipedia.org/wiki/Reduction_(complexity)
Function Problem (Wiki): https://en.wikipedia.org/wiki/Function_problem
Triangle Number (Wiki): https://en.wikipedia.org/wiki/Triangular_number
Видео The Formal Definition of P (P vs NP) канала Undefined Behavior
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Elaine Chang, Zachary Greenberg, Alex Egan
Twitter: https://twitter.com/UBehavior
—
P vs NP Playlist: https://www.youtube.com/playlist?list=PLlwsleWT767dnN25K_QgvdKkovK_t4K6-
Decision vs Search: https://cseweb.ucsd.edu/~mihir/cse200/decision-search.pdf
The Complexity of Decision versus Search: https://cseweb.ucsd.edu/~mihir/papers/compip.pdf
P (Wiki): https://en.wikipedia.org/wiki/P_(complexity)
Decision Problem (Wiki): https://en.wikipedia.org/wiki/Decision_problem
Reduction (Wiki): https://en.wikipedia.org/wiki/Reduction_(complexity)
Function Problem (Wiki): https://en.wikipedia.org/wiki/Function_problem
Triangle Number (Wiki): https://en.wikipedia.org/wiki/Triangular_number
Видео The Formal Definition of P (P vs NP) канала Undefined Behavior
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
NP: How Non-determinism Relates to Verifiable ProofsP vs. NP - An IntroductionWhy is P vs NP Important?Why Is It So Hard to Fix Traffic?What Is Big O? (Comparing Algorithms)Does P=NP? | Richard Karp and Lex FridmanP vs NP on TV - ComputerphileAlan Turing - Giants of Computer ScienceImpossible Programs (The Halting Problem)Are There Problems That Computers Can't Solve?Some Infinities ARE Bigger Than Other Infinities (Diagonalization)What Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)What Makes Mario NP-Hard? (Polynomial Reductions)How to Abolish the Electoral College (National Popular Vote Interstate Compact)Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex FridmanThe Halting Problem - An Impossible Problem to SolveIs Democracy Impossible? (Arrow's Theorem)What is complexity theory? (P vs. NP explained visually)Gödel's First Incompleteness Theorem, Proof SketchBeyond Computation: The P vs NP Problem - Michael Sipser