arXiv:cs/0701023 [cs.CC]AbstractReferencesReviewsResources A Polynomial Time Algorithm for 3-SAT Sergey Gubin Published 2007-01-04, updated 2008-07-15Version 4 Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT. Comments: 9 pages. The version consolidates results and shares know-how Categories: cs.CC, cs.DM, cs.DS, cs.LO Subjects: F.2.0, G.2.1, G.2.2 Keywords: polynomial time algorithm, efficient algorithms, generalizations 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 Sergey Gubin arXiv:cs/0703098 [cs.CC] (Published 2007-03-21) Polynomial time algorithm for 3-SAT. Examples of use Sergey Gubin arXiv:0711.2010 [cs.CC] (Published 2007-11-13, updated 2022-10-15) A Polynomial Time Algorithm for Graph Isomorphism Reiner Czerwinski Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:cs/0701023 [cs.CC]](http://oss.arxitics.com/images/favicon.svg)