filmov
tv
What Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)
![preview_player](https://i.ytimg.com/vi/XV6f7XYUMg8/maxresdefault.jpg)
Показать описание
There are a lot of unsolved problems in complexity theory, but there are a few things we do know. We look at the Time Hierarchy Theorem, and also why the proof techniques don't transfer to P vs NP.
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Zachary Greenberg, Elaine Chang, Brandon Chen
—
References:
Lectures:
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Zachary Greenberg, Elaine Chang, Brandon Chen
—
References:
Lectures:
P vs. NP: The Biggest Puzzle in Computer Science
P vs. NP and the Computational Complexity Zoo
What P vs NP is actually about
P vs. NP - The Biggest Unsolved Problem in Computer Science
P vs. NP - An Introduction
P vs NP on TV - Computerphile
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman
Das Millennium-Problem „P versus NP“ – Eines der sieben größten Abenteuer der Mathematik
16. Complexity: P, NP, NP-completeness, Reductions
P and NP - Georgia Tech - Computability, Complexity, Theory: Complexity
Stephen Cook on P vs NP
Should You Try To Solve P Vs NP? - Intro to Theoretical Computer Science
8. NP-Hard and NP-Complete Problems
Mind, Algorithms, P vs NP | Zaid Omar | TEDxWinchesterSchoolJebelAli
January 2022 CACM: Fifty Years of P vs. NP and the Possibility of the Impossible
What Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)
Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman
NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems
What will the P=NP proof look like? | Cal Newport and Lex Fridman
P vs. NP: Das MILLIONEN Dollar PROBLEM der Informatik
P vs NP explained quickly | Millennium prize problem
Does P=NP? | Po-Shen Loh and Lex Fridman
P = NP Explained Visually (Big O Notation & Complexity Theory)
Does P=NP? | Richard Karp and Lex Fridman
Комментарии