PhD Student Theoretical CS at IMScPhD Student Theoretical CS at IMSc
Made my family happy. Earned few friends. Learned some math. Serviced weird experiences. Tested corporate life. Wondered in deep forests. Dived in virgin pools. Sweated more than I should but less ... (more)Loading...
Pratik Tale, PhD Student Theoretical CS at IMScPhD Student Theoretical CS at IMSc
Class P vs NP can be described with the analogy of child and its lost toy. It is difficult to find lost toy(NP) than checking whether the found toy is desired by child(P). If child stop crying, we know the answer. In the spirit of Parameterized Compleity we retrain from discussing the difficult of finding the toy vs showing it to the child.
With crying baby on your shoulder, you have entire home to search for the toy. If you have robot servan...(more)
While I am closing down on my research area, now is good time to start writing what it is all about. Since Cook and Levin's work in 1970s, P vsNP has become one of the most important problem in 20th century. Danish mathematician Piet Hein once said "Problems worthy of attack prove their worth by fighting back". P vs NP has shown its might over the years. This question is a wonderful gift from computer science to mathematics.