Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Structural complexity theory / Arthur–Merlin protocol / Karp–Lipton theorem / Quantum complexity theory / NP / Interactive proof system / IP / Theoretical computer science / Computational complexity theory / Applied mathematics


Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗
Add to Reading List

Document Date: 2004-02-23 11:23:03


Open Document

File Size: 688,40 KB

Share Result on Facebook
UPDATE