Pages that link to "Item:Q5757455"
From MaRDI portal
The following pages link to Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← 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)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Sub-constant error probabilistically checkable proof of almost-linear size (Q626681) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← 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)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- A PCP of proximity for real algebraic polynomials (Q2117096) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← 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)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Small PCPs with low query complexity (Q2762515) (← 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)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- Quantum Locally Testable Codes (Q3449558) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Verifying and decoding in constant depth (Q3549643) (← links)
- Two-query PCP with subconstant error (Q3579632) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- Short PCPs with Polylog Query Complexity (Q3624377) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← 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)
