External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Dimitris Fotakis, Paul G. Spirakis. (poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. In Wojciech Penczek, Andrzej Szalas, editors, Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS 96, Cracow, Poland, September 2-6, 1996, Proceedings. Volume 1113 of Lecture Notes in Computer Science, pages 360-371, Springer, 1996.

Abstract

Abstract is missing.

runs on