Author(s)

Chao HAN

Corresponding Author

Chao HAN

Abstract

In 1971,Stephen Arthur Cook,an American-Canadian computer scientist,put forward a famous problem:P=NP or not?[1]In the past 50 years,large numbers of mathematicians from different countries have been sparing no effort to solve this problem,but they have never been succeed so far.Now,this article tries to prove that P≠NP by proving no polynomial-time algorithm of someone NP problem.

Keywords

P problem,NP problem,algorithm,polynomial time,Sudoku grid,time complexity