Re:The E-graph extraction problem is NP-complete
by deredede on Saturday June 24, 2023 @10:25AM
(#36458954)
I disagree. E-graphs as a data structure are used to represent an exponential combination of terms in a manageable (ie polynomial) structure. Thus, it is interesting to know what the limits of that "compression" are - what we can do in the polynomial representation and when we have to fall back to an exponential (or make compromises).
[ Parent
| on HN ]
There are no comments on this comment yet.