Pages that link to "Item:Q3624377"

The following pages link to Short PCPs with Polylog Query Complexity (Q3624377):

Displaying 47 items.

• Combinatorial PCPs with short proofs (Q260390) (← 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)
• Shorter arithmetization of nondeterministic computations (Q496013) (← links)
• Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
• Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• Smooth and strong PCPs (Q2029773) (← links)
• SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
• Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
• ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
• Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
• Asymptotically quasi-optimal cryptography (Q2170004) (← links)
• A PCP theorem for interactive proofs and applications (Q2170038) (← links)
• Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
• Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← links)
• Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
• Small PCPs with low query complexity (Q2762515) (← links)
• Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
• Short Locally Testable Codes and Proofs (Q3088191) (← links)
• Interactive Oracle Proofs (Q3181021) (← links)
• Quantum Locally Testable Codes (Q3449558) (← links)
• Parallel Hashing via List Recoverability (Q3457065) (← links)
• Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
• Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
• (Q4638059) (← links)
• Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
• Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
• ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
• On axis-parallel tests for tensor product codes (Q5002642) (← links)
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
• Explicit strong LTCs with inverse poly-log rate and constant soundness (Q5009557) (← links)
• Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
• Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
• On axis-parallel tests for tensor product codes (Q5140839) (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
• Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
• Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5885585) (← links)
• Small PCPs with low query complexity (Q5946703) (← links)
• Parallelizable delegation from LWE (Q6114288) (← links)
• Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← 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)