Amanote Research
Register
Sign In
Constant Rate PCPs for Circuit-Sat With Sublinear Query Complexity
doi 10.1109/focs.2013.42
Full Text
Open PDF
Abstract
Available in
full text
Date
October 1, 2013
Authors
Eli Ben-Sasson
Yohay Kaplan
Swastik Kopparty
Or Meir
Henning Stichtenoth
Publisher
IEEE
Related search
Small PCPs With Low Query Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Private Database Search With Sublinear Query Time
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Relaxed Locally Correctable Codes With Nearly-Linear Block Length and Constant Query Complexity
On the Character of Words of Sublinear Complexity
Acta Arithmetica
Number Theory
Algebra
Notions of Average-Case Complexity for Random 3-Sat
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Complexity of Max-Sat Using Stochastic Algorithms
Rate Constant for Reaction of CH (X2Π) With Ketene
J. Chem. Soc., Faraday Trans.
Low Complexity Equivalent Circuit Models for VLSI Interconnects
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
