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 pdpi on Tuesday September 05, 2017 @03:42AM (#15173233)
Both. As I understand it, polynomial time in a non-deterministic machine can be simulated as exponential time in a deterministic machine
[ Parent | on HN ]

There are no comments on this comment yet.