Pages that link to "Item:Q260390"
From MaRDI portal
The following pages link to Combinatorial PCPs with short proofs (Q260390):
Displaying 13 items.
- Combinatorial PCPs with efficient verifiers (Q483706) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- VC-dimensions of short Presburger formulas (Q2338619) (← 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)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- (Q5090443) (← links)
- (Q5139706) (← links)
- (Q5857610) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)