Modular algorithms in symbolic summation and symbolic integration

DOI10.1007/b104035zbMath1131.68121OpenAlexW1553454551WikidataQ56601798 ScholiaQ56601798MaRDI QIDQ2476158

Jürgen Gerhard

Publication date: 12 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104035

zbMATH Keywords

computer algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (6)

A deterministic algorithm for isolating real roots of a real polynomial ⋮ A general approach to isolating roots of a bitstream polynomial ⋮ Accelerating indefinite summation: simple classes of summands ⋮ Factorization of Polynomials and GCD Computations for Finding Universal Denominators ⋮ Sampling polynomial trajectories for LTL verification ⋮ Truncation bounds for differentially finite series

This page was built for publication: Modular algorithms in symbolic summation and symbolic integration