Article PDF
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Rights and permissions
About this article
Cite this article
Babai, L., Fortnow, L. & Lund, C. Non-deterministic exponential time has two-prover interactive protocols. Comput Complexity 2, 374 (1992). https://doi.org/10.1007/BF01200430
Issue Date:
DOI: https://doi.org/10.1007/BF01200430