Pages that link to "Item:Q2379685"
From MaRDI portal
The following pages link to Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685):
Displaying 18 items.
- On uniformity and circuit lower bounds (Q488049) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Local reduction (Q1641001) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Local Reductions (Q3448833) (← links)
- Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
- (Q4638059) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- STIR: Reed-Solomon proximity testing with fewer queries (Q6660306) (← links)