Symbolic Computation: Recent Progress and New Frontiers

Paul Zimmermann 1
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00107625
Contributor : Publications Loria <>
Submitted on : Thursday, October 19, 2006 - 9:03:19 AM
Last modification on : Thursday, January 11, 2018 - 6:20:00 AM
Long-term archiving on : Wednesday, March 29, 2017 - 1:04:45 PM

Identifiers

  • HAL Id : inria-00107625, version 1

Collections

Citation

Paul Zimmermann. Symbolic Computation: Recent Progress and New Frontiers. International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN), Sep 2002, none. ⟨inria-00107625⟩

Share

Metrics

Record views

113

Files downloads

44