A Polynomial Time Algorithm for 3-SAT
计算复杂性
2008-07-15 v4 离散数学
数据结构与算法
计算机科学中的逻辑
摘要
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
引用
@article{arxiv.cs/0701023,
title = {A Polynomial Time Algorithm for 3-SAT},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:cs/0701023},
year = {2008}
}
备注
9 pages. The version consolidates results and shares know-how