Pages Tagged With p vs np
By Bobby on 2009-01-05 02:56:25.632111
A while back i wrote some code for enumerating subsets and permutations of a given set. I was able to apply this to draw some images pertaining to the the question of P vs NP.
By Bobby on 2009-01-04 18:32:35.114278
NP-Complete problems are some of the most difficult problems to solve in Computer Science that do come up quite often. Many popular games are known to be NP-Complete (such as variable sized Sudoku). Here i describe another NP-Complete puzzle game and a simple proof by reduction from the Clique problem.