Finding almost-satisfying assignments

Uri Zwick*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

36 Scopus citations


There are only three non-trivial classes of conjunctive Boolean formula or constraint satisfaction problems for which satisfiability can be decided in polynomial time. These three classes are LIN, 2-SAT and HORN-SAT. The 2-SAT and HORN-SAT are essentially, the non-trivial classes of formula for which almost-satisfying assignments can be found in polynomial time (assuming P≠NP).

Original languageEnglish
Pages (from-to)551-560
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 1998
EventProceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: 23 May 199826 May 1998


Dive into the research topics of 'Finding almost-satisfying assignments'. Together they form a unique fingerprint.

Cite this