Pages that link to "Item:Q3581427"
From MaRDI portal
The following pages link to Simple PCPs with poly-log rate and query complexity (Q3581427):
Displaying 18 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- Simultaneous (poly-time, log-space) lower bounds (Q1102116) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Small PCPs with low query complexity (Q2762515) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- Short PCPs with Polylog Query Complexity (Q3624377) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- Small PCPs with low query complexity (Q5946703) (← links)