Re:Solving NP-hard puzzles with the oldest trick in the book
by master_yoda_1 on Thursday October 14, 2021 @01:08PM
(#28866988)
Many expert spend life on approximation of np hard problem. For the name of holy God if you don’t understand something then please don’t trivialize it.
Re:Solving NP-hard puzzles with the oldest trick in the book
by perl4ever on Thursday October 14, 2021 @10:58PM
(#28873660)
Was the headline changed from "problem" to "puzzle"?
Re:Solving NP-hard puzzles with the oldest trick in the book
by lostmsu on Friday October 15, 2021 @03:58PM
(#28882402)
Is this even a NP-hard problem?
Re:Solving NP-hard puzzles with the oldest trick in the book
by taintegral on Friday October 15, 2021 @07:08PM
(#28884171)
I would really enjoy a proof that it is not!
Quote from OP in another comment:
> I think a better way to phrase it is that we are writing a solver for a reasonable subset of inputs to an NP-hard problem.