Wednesday, August 11, 2010
Computer scientist Vinay Deolalikar claims to have solved maths riddle of P vs NP
A computer scientist claims to have solved one of the world’s most complex and intractable mathematical problems by proving that P≠NP.
August 11, 2010
“Vinay Deolalikar, who works at the research arm of Hewlett-Packard in Palo Alto, California, believes he has solved the riddle of P vs NP in a move that could transform mankind’s use of computers as well as earn him a $1m prize.
P vs NP is one of the seven millennium problems set out by the Massachusetts-based Clay Mathematical Institute as being the “most difficult” to solve.
Click to read the full story in Daily Telegraph
Commenting is not available in this weblog entry.
Related Articles
- India objects to Jay Leno’s joke on Golden Temple
- Ambassador Nirupama Rao meets Congressman Adam Smith
- Indian-American mom gives birth to child on train to NYC
- “Healing Spices” Author Cooks Global Flavors for Better Health
- Bollywood bash for Oprah Winfrey - Bollywood gives Oprah warm welcome
- UA System Chancellor Dr. Malcolm Portera Announces Retirement
- Indian-American group learns to shoot after break-ins
- Kansas Student Wins ‘Who Wants to Be a Mathematician’
- Birmingham AAPI’s new leadership aims to expand to younger members
- Satyendra Huja Named New Charlottesville Mayor
Most Recent
- India objects to Jay Leno’s joke on Golden Temple
- Ambassador Nirupama Rao meets Congressman Adam Smith
- Indian-American mom gives birth to child on train to NYC
- “Healing Spices” Author Cooks Global Flavors for Better Health
- Bollywood bash for Oprah Winfrey - Bollywood gives Oprah warm welcome
- UA System Chancellor Dr. Malcolm Portera Announces Retirement
- Indian-American group learns to shoot after break-ins
- Kansas Student Wins ‘Who Wants to Be a Mathematician’
- Birmingham AAPI’s new leadership aims to expand to younger members
- Satyendra Huja Named New Charlottesville Mayor