Abstract
We consider a class of simplification algorithms for algebraic and logical expressions which are of systematic use in computer algebra systems. This class is basically characterized by the fact that algorithms operate in a bottom-up recursive way on the expressions, i.e. start from the atomic terms—constants and variables—and perform the simplifications on larger and larger terms until the whole expression is ultimately proceeded; no backtracking or iterated process should intervene in the simplification. We show that under these quite general assumptions, it is possible to analyze precisely, and almost automatically, the average size of the resulting expressions—the gain in space—and the average time complexity of the process, which happens to be linear, whereas the worst-case behaviour is not in general.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
