arXiv Analytics

Sign in

arXiv:cs/0703098 [cs.CC]AbstractReferencesReviewsResources

Polynomial time algorithm for 3-SAT. Examples of use

Sergey Gubin

Published 2007-03-21Version 1

The algorithm checks the propositional formulas for patterns of unsatisfiability.

Comments: 19 pages
Categories: cs.CC, cs.DM, cs.DS, cs.LO
Subjects: F.2.0, G.2.1, G.2.2
Related articles: Most relevant | Search more
arXiv:cs/0703146 [cs.CC] (Published 2007-03-29, updated 2012-05-07)
A Polynomial Time Algorithm for SAT
arXiv:cs/0701023 [cs.CC] (Published 2007-01-04, updated 2008-07-15)
A Polynomial Time Algorithm for 3-SAT
arXiv:2304.12517 [cs.CC] (Published 2023-04-25)
The 2-MAXSAT Problem Can Be Solved in Polynomial Time