Conditional Hardness of Approximating Satisfiable Max 3CSP-q

DOI10.1007/978-3-642-10631-6_93MaRDI QIDQ3652279zbMATH OpenOpenAlexFDO

Authors Lin-Qing Tang

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_93

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Conditional hardness for satisfiable 3-CSPs
• On the hardness of approximating max-satisfy
• The Approximability of Three-valued MAX CSP
• An approximation algorithm for MAX 3-SAT
• Simpler 3/4-approximation algorithms for MAX SAT
• Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\)
• A new bound for 3-satisfiable MaxSat and its algorithmic application
• A new bound for 3-satisfiable MaxSat and its algorithmic application
• More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
• STACS 2005

Cited in

(7)

• md-MST is NP-hard for \(d\geq 3\)
• The quest for strong inapproximability results with perfect completeness
• The Quest for Strong Inapproximability Results with Perfect Completeness
• Conditional hardness for satisfiable 3-CSPs
• The Approximability of Three-valued MAX CSP
• scientific article; zbMATH DE number 7650382 (Why is no real title available?)
• Approximating satisfiable satisfiability problems (extended abstract)

This page was built for publication: Conditional Hardness of Approximating Satisfiable Max 3CSP-q

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652279)