DocumentCode :
2580181
Title :
Tutorial: Current state of P vs NP problem
Author :
Srinivasan, N.
Author_Institution :
NetApp, Bangalore, India
fYear :
2011
fDate :
3-5 June 2011
Firstpage :
1
Lastpage :
1
Abstract :
Do I understand the problem of P vs. NP? The answer is a simple "no". If I were to understand the problem, I would\´ve solved it as well" - This is the current state of many theoretical computer scientists around the world. Apart from a bag of laureates waiting for the person who successfully understands this most popular millennium prize riddle, this is also considered to be a game changer in both mathematics and computer science. According to Scott Aaronson, "If P = NP, then the world would be a profoundly different place than we usually assume it to be". The speaker intends to share the part that he understood on the problem, and about the efforts that were recently put-forth in cracking the same.
Keywords :
computational complexity; NP problem; P problem; computer science; Computer science; Computers; File systems; Games; Industries; Mathematics; Tutorials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Recent Trends in Information Technology (ICRTIT), 2011 International Conference on
Conference_Location :
Chennai, Tamil Nadu
Print_ISBN :
978-1-4577-0588-5
Type :
conf
DOI :
10.1109/ICRTIT.2011.5972506
Filename :
5972506
Link To Document :
بازگشت