Pages that link to "Item:Q260390"
From MaRDI portal
The following pages link to Combinatorial PCPs with short proofs (Q260390):
Displaying 7 items.
- 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)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- (Q5090443) (← links)
- (Q5857610) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)