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 cropsieboss on Monday September 04, 2017 @03:04PM (#15170214)
Finding a polynomial algorithm for #P problem implies P=NP.
[ Parent | on HN ]
Re:The N-Queens completion problem is NP-hard by kmill on Monday September 04, 2017 @03:23PM (#15170303)
Surely you mean finding a polynomial algorithm for a #P-complete problem?
[ Parent | on HN ]