Back to Search Start Over

Non-deterministic exponential time has two-prover interactive protocols

Authors :
L�szl� Babai
Lance Fortnow
Carsten Lund
Source :
Computational Complexity. 1:3-40
Publication Year :
1991
Publisher :
Springer Science and Business Media LLC, 1991.

Subjects

Subjects :
Computational Mathematics
Computational Theory and Mathematics
General Mathematics
Theoretical Computer Science

Details

ISSN :
14208954 and 10163328
Volume :
1
Database :
OpenAIRE
Journal :
Computational Complexity
Accession number :
edsair.doi...........0b17b136d4fa77a321d12506b181bd65
Full Text :
https://doi.org/10.1007/bf01200056
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details