In a 2002 poll, 61 mathematicians and computer scientists said that they thought P probably didn’t equal NP, to only nine who thought it did — and of those nine, several told the pollster that they took the position just to be contrary. But so far, no one’s been able to decisively answer the question one way or the other.
Even though the vast majority of CS researchers believe that P does not equal NP, no one has been able to prove otherwise and the problem remains the biggest unsolved question in Computer Science to date.
2009
Plagiarism Detection by using Karp-Rabin and String
Matching Algorithm Together.
Computer scientists have developed an algorithm that makes use of the well-known Karp-Rabin algorithm in order to efficiently detect plagiarism in academic work.
2015
In the 1995 Halloween episode of The Simpsons, Homer Simpson finds a portal to the mysterious Third Dimension behind a bookcase, and desperate to escape his in-laws, he plunges through. He finds himself wandering across a dark surface etched with green gridlines and strewn with geometric shapes, above which hover strange equations. One of these is the deceptively simple assertion that P = NP.
The biggest unsolved mystery in Computer Science explained, the question that will earn 1M dollars to the first person to prove the answer. If answered as yes, this question will change the world of Computer Science as we know it today.
2009
