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

Dimitris Fotakis, Paul G. Spirakis

Browse the full MFCS paper archive.