Polynomial time algorithm for 3-SAT. Examples of use
Computational Complexity
2007-05-23 v1 Discrete Mathematics
Data Structures and Algorithms
Logic in Computer Science
Abstract
The algorithm checks the propositional formulas for patterns of unsatisfiability.
Keywords
Cite
@article{arxiv.cs/0703098,
title = {Polynomial time algorithm for 3-SAT. Examples of use},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:cs/0703098},
year = {2007}
}
Comments
19 pages