Constant rate PCPs for circuit-SAT with sublinear query complexity

Ben-Sasson, Eli and Kaplan, Yohay and Kopparty, Swastik and Meir, Or and Stichtenoth, Henning (2013) Constant rate PCPs for circuit-SAT with sublinear query complexity. In: FOCS 2013 IEEE Symposium on Foundations of Computer Science, Berkeley, USA (Accepted/In Press)

Full text not available from this repository.

Item Type:	Papers in Conference Proceedings
Subjects:	Q Science > QA Mathematics > QA075 Electronic computers. Computer science Q Science > QA Mathematics
ID Code:	21703
Deposited By:	Henning Stichtenoth
Deposited On:	23 Jul 2013 14:25
Last Modified:	01 Aug 2019 10:40

Repository Staff Only: item control page