Skip to main content
Conference Proceedings

Conditional hardness of approximating satisfiable max 3CSP-q

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5878 LNCS 923-932
DOI: 10.1007/978-3-642-10631-6_93
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article, we study the approximability of satisfiable Max 3CSP-q for q>3 be a prime. We give a -hardness result for approximate Max 3CSP-q even on satisfiable instances, conditioned on Khot's d-to-1 Conjecture, for any finite constant integer d

Cite

CITATION STYLE

APA

Tang, L. (2009). Conditional hardness of approximating satisfiable max 3CSP-q. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 923–932). https://doi.org/10.1007/978-3-642-10631-6_93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free