Finding almost-satisfying assignments

Uri Zwick

doi:10.1145/276698.276869

Finding almost-satisfying assignments

Uri Zwick^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Conference article › peer-review

36 Scopus citations

Abstract

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 language	English
Pages (from-to)	551-560
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/276698.276869
State	Published - 1998
Event	Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA Duration: 23 May 1998 → 26 May 1998

Access to Document

10.1145/276698.276869

Cite this

@article{15999be390c541fcbe3489a158d09fdd,

title = "Finding almost-satisfying assignments",

abstract = "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).",

author = "Uri Zwick",

year = "1998",

doi = "10.1145/276698.276869",

language = "אנגלית",

pages = "551--560",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing ; Conference date: 23-05-1998 Through 26-05-1998",

}

TY - JOUR

T1 - Finding almost-satisfying assignments

AU - Zwick, Uri

PY - 1998

Y1 - 1998

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=0031623606&partnerID=8YFLogxK

U2 - 10.1145/276698.276869

DO - 10.1145/276698.276869

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0031623606

SN - 0734-9025

SP - 551

EP - 560

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing

Y2 - 23 May 1998 through 26 May 1998

ER -

Finding almost-satisfying assignments

Abstract

Access to Document

Other files and links

Fingerprint

Cite this