
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.
An explanation that started from checking a completed puzzle
Handed a filled-in grid you can verify it in a minute; filling it in yourself is another matter. That opening got the question across to a non-technical audience in thirty seconds and I have used it ever since.
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).Appreciate it? Launch a heart of approval!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.