Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration

DOI10.1145/2815111.2815112zbMATH Open1334.68307OpenAlexW2220758058WikidataQ131125492 ScholiaQ131125492MaRDI QIDQ2802385FDOQ2802385

Authors: Richard Fateman 

Publication date: 25 April 2016

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2815111.2815112

Recommendations

• Domains and expressions: an interface between two approaches to computer algebra
• scientific article; zbMATH DE number 4193837
• A new algorithm for partitioned symbolic reachability analysis
• Symbolic computation on the partition lattice of an \(n\)-set
• A method of verifying partition congruences by symbolic computation
• Integration of computer algebra systems and interval computation
• An algorithm for computing compatibly Frobenius split subvarieties
• A new algorithm for symbolic integration with application
• scientific article; zbMATH DE number 5587863

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Symbolic integration
• A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus

Cited In (1)

• Knowledge-based automatic generation of partitioned matrix expressions

Uses Software

• Mathematica
• Maxima
• MACSYMA

This page was built for publication: Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration

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