https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100828
Patrick Palka <ppalka at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|UNCONFIRMED |ASSIGNED
CC| |ppalka at gcc dot gnu.org
Ever confirmed|0 |1
Last reconfirmed| |2021-07-19
Assignee|unassigned at gcc dot gnu.org |ppalka at gcc dot
gnu.org
Target Milestone|--- |11.2
--- Comment #1 from Patrick Palka <ppalka at gcc dot gnu.org> ---
Confirmed. This complexity limit is probably there because the subsumption
algorithm (namely the conversion to DNF/CNF) can use an exponential amount of
space, but I think we can improve this and avoid the exponential memory usage
in the first place. Then we could safely remove the complexity limit.
