complexity theory paper
C33131
concept
A complexity theory paper is a scholarly work that rigorously analyzes the computational resources required to solve problems, classifies them into complexity classes, and explores relationships or separations between these classes.
Observed surface forms (7)
- circuit complexity lower bound ×1
- complexity-theoretic result ×1
- computational complexity theorem ×1
- landmark paper in computer science ×1
- landmark result in computational complexity theory ×1
- quantum computing paper ×1
- result in theoretical computer science ×1
Instances (8)
- BQP vs. the Polynomial Hierarchy
- The Complexity of Quantum States and Transformations via concept surface "quantum computing paper"
-
"The Complexity of Theorem-Proving Procedures"
surface form: The Complexity of Theorem-Proving Procedures
- Valiant–Vazirani theorem via concept surface "computational complexity theorem"
-
MIP equals NEXP
via concept surface "complexity-theoretic result"
surface form: MIP = NEXP
- Furst–Saxe–Sipser lower bounds via concept surface "circuit complexity lower bound"
- AKS primality test via concept surface "landmark result in computational complexity theory"
- Finite Automata and Their Decision Problems via concept surface "landmark paper in computer science"