Polynomial time algorithm for 3-SAT. Examples of use
计算复杂性
2007-05-23 v1 离散数学
数据结构与算法
计算机科学中的逻辑
摘要
The algorithm checks the propositional formulas for patterns of unsatisfiability.
引用
@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}
}
备注
19 pages