Algebraic simplification in computer algebra: an analysis of bottom-up algorithms

DOI10.1016/0304-3975(90)90078-VMaRDI QIDQ914384zbMATH OpenFDO

Authors Rafael Casas, María-Inés Fernández-Camacho, Jean-Marc Steyaert

Publication date 1990

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(90)90078-V

zbMATH Keywords

algebraic and logical expressionsaverage sizeaverage time complexitybottom-up recursivesimplification algorithmssymbolic and algebraic manipulations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 2145000
• Computer algebra applied to itself
• A poly-algorithmic approach to simplifying elementary functions
• scientific article; zbMATH DE number 3854413
• A discussion and implementation of Brown's REX simplification algorithm

Cites work

• A complexity calculus for recursive tree algorithms
• Average size of simplified trees
• scientific article; zbMATH DE number 3978405 (Why is no real title available?)
• scientific article; zbMATH DE number 3502750 (Why is no real title available?)
• scientific article; zbMATH DE number 3587312 (Why is no real title available?)
• Mechanical program analysis
• On the Altitude of Nodes in Random Trees
• Verifying Program Performance

Cited in

(9)

• Computer algebra applied to itself
• Reductions in binary search trees
• Automated simplification of large symbolic expressions
• A discussion and implementation of Brown's REX simplification algorithm
• On the Average Size of Glushkov’s Automata
• scientific article; zbMATH DE number 2145000 (Why is no real title available?)
• Analytic analysis of algorithms
• Towards a computer algebraic algorithm for flat output determination
• The effects of semantic simplifications on random \textit{BST}-like expression-trees

This page was built for publication: Algebraic simplification in computer algebra: an analysis of bottom-up algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914384)