Constant rate PCPs for circuit-SAT with sublinear query complexity

DOI10.1109/FOCS.2013.42MaRDI QIDQ6981743zbMATH OpenFDO

Authors Or Meir, Henning Stichtenoth, Eli Ben-Sasson, Swastik Kopparty, Yohay Kaplan

Publication date 20 May 2025

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

This page was built for publication: Constant rate PCPs for circuit-SAT with sublinear query complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981743)