A Polynomial Time Algorithm for SAT
arXiv:cs/0703146
Abstract
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
Update, 30 pages