arXiv Analytics

Sign in

arXiv:cs/0703146 [cs.CC]AbstractReferencesReviewsResources

A Polynomial Time Algorithm for SAT

Sergey Gubin

Published 2007-03-29, updated 2012-05-07Version 4

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

Comments: Update, 30 pages
Categories: cs.CC, cs.DM, cs.DS, cs.LO
Subjects: F.2.0, G.2.1, G.2.2
Related articles: Most relevant | Search more
arXiv:cs/0701023 [cs.CC] (Published 2007-01-04, updated 2008-07-15)
A Polynomial Time Algorithm for 3-SAT
arXiv:cs/0703098 [cs.CC] (Published 2007-03-21)
Polynomial time algorithm for 3-SAT. Examples of use
arXiv:1005.3010 [cs.CC] (Published 2010-05-17, updated 2010-09-21)
A Proof for P =? NP Problem

Links

Toolbox