<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2006-11-24 03:54:09Complexity classes Quantum complexity theory Models of computation Quantum information science PP Karp–Lipton theorem P versus NP problem Quantum algorithm Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics |
| Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, AustriaDocID: 17DR8 - View Document |
| PDF DocumentDocID: 17g12 - View Document |
| Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗DocID: c5rU - View Document |
| Canonical Disjoint NP-Pairs of Propositional Proof Systems Christian Glaßer ∗ Alan L. Selman†DocID: c0h0 - View Document |
| A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decidedDocID: 8HD1 - View Document |