
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.
The letters get read as an abbreviation of not polynomial
It stands for nondeterministic polynomial and an enormous number of people, including some who write about it, take it to mean the opposite of the first class. The naming is genuinely unfortunate and the misreading is everywhere.
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).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.