Constant rate PCPs for circuit-SAT with sublinear query complexity

Warning The system is temporarily closed to updates for reporting purpose.

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. (Request a copy)
Item Type: Papers in Conference Proceedings
Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Q Science > QA Mathematics
Divisions: Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics
Faculty of Engineering and Natural Sciences
Depositing User: Henning Stichtenoth
Date Deposited: 23 Jul 2013 14:25
Last Modified: 26 Apr 2022 09:10
URI: https://research.sabanciuniv.edu/id/eprint/21703

Actions (login required)

View Item
View Item