2 papers
cs.CC2012
P = NP
Sergey V. Yakhontov
The present work proves that P=NP. The proof, presented in this work, is a constructive one: the program of a polynomial time deterministic multi-tape Turing machine M_ExistsAccept…
cs.CC2004
P=NP
Selmer Bringsjord, Joshua Taylor
We claim to resolve the P=?NP problem via a formal argument for P=NP.