Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration
type: Item
instance of: scholarly article
zbMATH Open document ID: 1334.68307
DOI: 10.1145/2815111.2815112
author: Richard Fateman
published in: ACM Communications in Computer Algebra
publication date: 2016-04-25T00:00:00Z
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6573511
describes a project that uses: Mathematica
describes a project that uses: Maxima
describes a project that uses: MACSYMA
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/2815111.2815112
OpenAlex ID: W2220758058
cites work: Symbolic integration
cites work: A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
Wikidata QID: Q131125492
Recommended article: Domains and expressions
Recommended article: Q5202281
Recommended article: A New Algorithm for Partitioned Symbolic Reachability Analysis
Recommended article: Symbolic computation on the partition lattice of an \(n\)-set
Recommended article: A method of verifying partition congruences by symbolic computation
Recommended article: Integration of computer algebra systems and interval computation
Recommended article: An algorithm for computing compatibly Frobenius split subvarieties
Recommended article: A new algorithm for symbolic integration with application
Recommended article: Q5191028
title: Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration
description: scientific article; zbMATH DE number 6573511