Query-Efficient Dictatorship Testing with Perfect Completeness

DOI10.1007/978-3-642-16367-8_20zbMath1309.68216OpenAlexW1889301785MaRDI QIDQ4933378

Victor Chen

Publication date: 12 October 2010

Published in: Property Testing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_20

zbMATH Keywords

probabilistically checkable proofsdictatorship test

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Related Items (1)

Testing Juntas: A Brief Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof verification and the hardness of approximation problems
• A PCP characterization of NP with optimal amortized query complexity
• Conditional Hardness for Approximate Coloring
• On the power of unique 2-prover 1-round games
• A Hypergraph Dictatorship Test with Perfect Completeness
• Probabilistic checking of proofs
• A Parallel Repetition Theorem
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Testing Basic Boolean Formulae
• Simple analysis of graph tests for linearity and PCP
• Conditional hardness for satisfiable 3-CSPs
• Gowers Uniformity, Influence of Variables, and PCPs
• Some optimal inapproximability results
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
• STACS 2005
• A new proof of Szemerédi's theorem

This page was built for publication: Query-Efficient Dictatorship Testing with Perfect Completeness