Pages that link to "Item:Q5757456"
From MaRDI portal
The following pages link to Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem (Q5757456):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
- On the rectangle method in proofs of robustness of tensor products (Q437691) (← links)
- Combinatorial PCPs with efficient verifiers (Q483706) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Cube vs. Cube Low Degree Test. (Q4638094) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5002642) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5002796) (← links)
- (Q5009557) (← links)
- (Q5090398) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5090443) (← links)
- (Q5093398) (← links)
- Bridging a Small Gap in the Gap Amplification of Assignment Testers (Q5098766) (← links)
