NEW DELHI—Mathematician Vinay Deolalikar at the Hewlett-Packard Labs in California claims to have solved one of the most complex problems of mathematics, the P vs. NP problem. It involves a method of determining whether a problem is solvable by computer and is itself one of seven intractable problems for which the Clay Mathematics Institute in Boston 10 years ago offered a prize of $1 million to the first person to find a solution.
Deolalikar, who studied electrical engineering at the Indian Institute of Technology, Bombay, published his manuscript online on his own Web page.
Other researchers have yet to confirm Deolalikar's supposed proof. The claim is expected to create a wave at the International Congress of Mathematians starting 19 August at Hyderabad.