Symbolic Computation: Recent Progress and New FrontiersReport as inadecuate

Symbolic Computation: Recent Progress and New Frontiers - Download this document for free, or read online. Document in PDF available to download.

1 SPACES - Solving problems through algebraic computation and efficient software INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications

Abstract : Symbolic computation and computer algebra systems are usually known to be either very slow, or memory expensive. However, some specific symbolic computation problems have received in the last years new algorithmic solutions, which enabled to push further the limits of what is doable within a reasonable amount of time and space. Some noticeable examples are polynomial factorisation, lattice reduction, Groebner basis computation. We will present a few such algorithms, together with a state-of-the-art of what problems computer algebra systems can or cannot solve, and for each problem what the current frontiers are.

keyword : recent result computer algebra résultat nouveau calcul formel

Author: Paul Zimmermann -



Related documents