„probabilistic checkable proofs“
Suchergebnisse
17 Treffer
-
On the hardness of approximating shortest integer relations among rational numbers
-
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
-
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
-
On Parallel Repetition of PCPs
-
Black-Box Constructive Proofs Are Unavoidable
-
On the Impossibility of Probabilistic Proofs in Relativized Worlds
-
Smooth and Strong PCPs
-
Improved 3LIN Hardness via Linear Label Cover
-
Erasures vs. Errors in Local Decoding and Property Testing
-
Every Set in P Is Strongly Testable Under a Suitable Encoding
-
Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing
-
Relaxed Locally Correctable Codes
-
Interactive Oracle Proofs with Constant Rate and Query Complexity
-
Cube vs. Cube Low Degree Test
-
Hardness of Approximation (Invited Talk)
-
Identifying an Honest EXP^NP Oracle Among Many
-
On Approximation Resistance of Predicates (Invited Talk)