P versus NP problem Solved by Indian Origin Scientist
@abrakadabra
•
Sep 29, 2024
Sep 29, 2024
1.1K
An Indian-origin computer scientist based in the US claims to have solved one of the world's most complex mathematical riddles.
Vinay Deolalikar, who works with the US multinational information technology corporation Hewlett-Packard in California, believes he has solved the problem of "P versus NP".
t is considered the "most difficult" one to be solved.
If his claim is proved correct, Deolalikar stands to earn a $1 million prize. 😀
P.S: Mathematicians Stephen Cook and Leonid Levin formalised the problem in 1971.
Vinay Deolalikar, who works with the US multinational information technology corporation Hewlett-Packard in California, believes he has solved the problem of "P versus NP".
t is considered the "most difficult" one to be solved.
If his claim is proved correct, Deolalikar stands to earn a $1 million prize. 😀
P.S: Mathematicians Stephen Cook and Leonid Levin formalised the problem in 1971.
