Symbolic Computation: Recent Progress and New Frontiers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Symbolic Computation: Recent Progress and New Frontiers

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
A02-R-488.pdf (576.19 Ko) Télécharger le fichier

Dates and versions

inria-00107625 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00107625 , version 1

Cite

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⟩
53 View
19 Download

Share

Gmail Facebook X LinkedIn More