Conditional Hardness of Approximating Satisfiable Max 3CSP-q

DOI10.1007/978-3-642-10631-6_93zbMath1273.68154OpenAlexW1521487341MaRDI QIDQ3652279

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)

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