News for hackers. Stuff that matters.

A comment on Why Philosophers Should Care About Computational Complexity. Parent comment

Re:Why Philosophers Should Care About Computational Complexity by strlen on Tuesday August 09, 2011 @01:42PM (#2864936)
No, NP-hard problems can still be solved, just not in polynomial time.
[ Parent | on HN ]

There are no comments on this comment yet.