A Polynomial Time Algorithm for SAT
计算复杂性
2012-05-08 v4 离散数学
数据结构与算法
计算机科学中的逻辑
摘要
Article presents the compatibility matrix method and illustrates it with the application to P vs NP problem. The method is a generalization of descriptive geometry: in the method, we draft problems and solve them utilizing the image creation technique. The method reveals: P = NP = PSPACE
引用
@article{arxiv.cs/0703146,
title = {A Polynomial Time Algorithm for SAT},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:cs/0703146},
year = {2012}
}
评论
Update, 30 pages