ConceptNP难 / 组合优化
Computational Complexity
A theoretical field that studies the intrinsic difficulty of computational problems, classifying problems by how hard they are to solve. NP-hard problems are those for which no exact polynomial-time algorithm is known.
Timeline (last 90 days)
Oct 14
Scott Aaronson is one of the most influential theorists in the fields of quantum computing and computational complexity.
Unverified50%
Oct 14
The Aaronson Oracle connects three fields: computational complexity, cryptography, and cognitive science.
Unverified50%