The minimal hitting set generation problem: algorithms and computation — mentioned by eesmith

Sat, 13 May 2023 17:05:46 GMT

I'm not criticizing. I think less than an order of magnitude from an off-the-head memory is just fine. And after 10 years, computers have gotten more powerful. ;) I misread the paper. I think is saying that finding the minimal size is NP-complete. Here's the abstract: "The hitting set problem is computationally hard; it is one of Karp’s 21 classic NP-complete problems. A standard backtracking algorithm for finding hitting sets would not be fast enough to search for a 16-clue sudoku puzzle exhaustively, even at today’s supercomputer speeds." For context, https://arxiv.org/pdf/1601.02939.pdf…

Paper and discussion history. A mention is not an endorsement.

The minimal hitting set generation problem: algorithms and computation · HackerPapers discussions

The minimal hitting set generation problem: algorithms and computation — mentioned by eesmith