Computer Algebra relies heavily on the computation of Grobner bases, and these computations are primarily performed by means of Buchberger's algorithm. In this overview paper, we focus on methods avoiding the computational intensity associated to Buchberger's algorithm and, in most cases, even avoiding the concept of Grobner bases, in favour of methods relying on linear algebra and combinatorics.

Degrobnerization: a political manifesto

Ceria, M;
2022-01-01

Abstract

Computer Algebra relies heavily on the computation of Grobner bases, and these computations are primarily performed by means of Buchberger's algorithm. In this overview paper, we focus on methods avoiding the computational intensity associated to Buchberger's algorithm and, in most cases, even avoiding the concept of Grobner bases, in favour of methods relying on linear algebra and combinatorics.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11589/245385
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact