Indian HP researcher solves P&NP math problem

According the sources, Deolalikar's new invented theory on P versus NP problem is still to be approved by the other research institutions such as the Clay Mathematics Institute.
But still Deolalikar's theory is giving very promising note to the mathematicians, who are struggling to solve N versus NP problem for so long.
Vice chairman of Mahindra & Mahindra, Anand G Mahindra said on Twitter, "If Deolalikar's theory validated, I hope he'll receive as much veneration as our sports heroes."
The P versus NP problem is a major unsolved problem in mathematics that is important in both theoretical computer science and mathematical logic.
The P versus NP problem is to determine whether every language accepted by some unsettled algorithm in polynomial time is also accepted by some (deterministic) algorithm in polynomial time.
OneIndia News












Click it and Unblock the Notifications