News for hackers. Stuff that matters.
Re:Solving NP-hard puzzles with the oldest trick in the book by contravariant on Saturday October 16, 2021 @09:56AM (#28887909)
I should have been a bit more careful I suppose, but in practice you can't increase k indefinitely without also increasing n anyway. In particular n >= k, so at worst it would be something like k^k / k!.

There are no comments on this comment yet.