2010/01/21 by Rakesh Dube, Dube, Rakesh
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
paper · pdf · doi:10.48550/arxiv.1001.3816
Removed by arXiv administration due to plagiarism from Stephen Cook's description of the problem for the Clay Mathematics Institute. See http://gauss.claymath.org:8888/millennium/P_vs_NP/pvsnp.pdf for the original text
arxiv created 2010/01/22 · arxiv updated 2010/02/26
Removed by arXiv administration. This article was plagiarized directly from Stephen Cook's description of the problem for the Clay Mathematics Institute. See http://gauss.claymath.org:8888/millennium/PvsNP/pvsnp.pdf for the original text.