
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.
Where should I start if I have a maths degree and no complexity background
The popular articles are too vague to build on and the graduate texts assume a course I never took. Is there an accepted first book for someone in that position, or do people generally work through the standard textbook's early chapters?
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 question marks to show your curiosity!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.