Improve symbolic simplifier for expressions
|Reported by:||gkronber||Owned by:|
|Priority:||medium||Milestone:||HeuristicLab 3.3.x Backlog|
Description (last modified by gkronber)
Related to #2609. Where it was observed that "I'm surprised that it is necessary to check the case of only one sub-tree for multiplications. Does the simplifier really produce these cases? It would be trivial to remove the multiplication node in such cases."
Probably it's time to completely refactor the simplifier. Potentially helpful resources:
- http://www.ukma.edu.ua/~yubod/teach/compalgebra/%5BJoel_S._Cohen%5D_Computer_algebra_and_symbolic_comp(BookFi.org).pdf (page 92 ff)
- http://inst.cs.berkeley.edu/~cs282/sp02/readings/liska.pdf (featuring Franz Winkler)