News for hackers. Stuff that matters.

A comment on The N-Queens completion problem is NP-hard. Parent comment

Re:The N-Queens completion problem is NP-hard by thomasahle on Wednesday September 06, 2017 @08:22AM (#15183024)
Computational hardness doesn't depend on whether anybody knows an efficient algorithm. Just whether one exists.
[ Parent | on HN ]
Re:The N-Queens completion problem is NP-hard by taeric on Wednesday September 06, 2017 @10:12AM (#15183802)
Fair enough. I was obviously reading the above as having a polynomial time as having an efficient time one. Where efficient was shorthand for "quick." Both leaps, I concede were misguided.
[ Parent | on HN ]