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

DOI10.1016/0304-3975(90)90078-VzbMath0701.68045MaRDI QIDQ914384

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

Publication date: 1990

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

zbMATH Keywords

average time complexityaverage sizealgebraic and logical expressionsbottom-up recursivesimplification algorithmssymbolic and algebraic manipulations

Mathematics Subject Classification ID

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

Related Items (5)

Reductions in binary search trees ⋮ The effects of semantic simplifications on random \textit{BST}-like expression-trees ⋮ Automated simplification of large symbolic expressions ⋮ Analytic analysis of algorithms ⋮ On the Average Size of Glushkov’s Automata

Cites Work

• A complexity calculus for recursive tree algorithms
• Mechanical program analysis
• Verifying Program Performance
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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