(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP

• Authors:

• Dimitris Fotakis;Paul G. Spirakis

• Affiliations:

• -;-

• Venue:
• MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
• Year:
• 1996