A Polynomial Time Algorithm for SAT
<|reference_start|>A Polynomial Time Algorithm for SAT: 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<|reference_end|>
@article{gubin2007a,
    title={A Polynomial Time Algorithm for SAT},
    author={Sergey Gubin},
    journal={arXiv preprint arXiv:cs/0703146},
    year={2007},
    number={MCCCC 23,24,25},
    archivePrefix={arXiv},
    eprint={cs/0703146},
    primaryClass={cs.CC cs.DM cs.DS cs.LO}
}