A Polynomial Time Algorithm for 3-SAT
Computational Complexity
2008-07-15 v4 Discrete Mathematics
Data Structures and Algorithms
Logic in Computer Science
Abstract
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
Keywords
Cite
@article{arxiv.cs/0701023,
title = {A Polynomial Time Algorithm for 3-SAT},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:cs/0701023},
year = {2008}
}
Comments
9 pages. The version consolidates results and shares know-how