News for hackers. Stuff that matters.
Re:Throwing some light on NP-completeness and the P=NP problem by rw on Wednesday June 03, 2009 @02:52PM (#640196)
The nondeterministic characterization is easier to work with.

There are no comments on this comment yet.