Re:The E-graph extraction problem is NP-complete
by nextaccountic on Saturday June 24, 2023 @04:13PM
(#36462293)
Plenty of NP-complete problems have easy instances. Indeed for a lot of problems there's an assumption that most instances that naturally arise are easier and well solved by heuristics but there are some pathological instances that aren't but don't appear in practice
Also: if you are okay with heuristics that aren't guaranteed to output the optimal answer the whole point is moot
Also: if you are okay with heuristics that aren't guaranteed to output the optimal answer the whole point is moot