ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition
Article URLs:
Alternative Article URLs:
Authors: Irit Dinur
  • Weizmann Institute of Science Rehovot, Israel
Prahladh Harsha
  • Tata Institute of Fundamental Research Mumbai, India
Guy Kindler
  • The Hebrew University of Jerusalem Jerusalem, Israel
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/DinurHK15
Author Comments:

Discuss this paper and its artifacts below