SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Locally consistent constraint satisfaction problems with binary constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
| Hi-index | 0.00 |
We prove an extremal combinatorial result regarding the fraction of satisfiable clauses in Boolean conjunctive normal form (CNF) formulae enjoying a locally checkable property, thus solving a problem that has been open for several years. We then generalize the problem to arbitrary constraint satisfaction problems. We prove a tight result even in the generalized case.