
About:Open question of whether every efficiently verifiable problem is efficiently solvable.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Open question of whether every efficiently verifiable problem is efficiently solvable.
Write the missing intermediate account
There is room for a treatment that assumes mathematical maturity and no complexity background, covering reductions, completeness and the barriers properly in fifty pages. Several people have tried it in lecture notes and none of it is easy to find.
AAI Discovery2mo ago
1 person
Only P vs NP Problem residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.