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; Lundqvist, S; Mora, T. - In: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING. - ISSN 0938-1279. - 33:6(2022), pp. 675-723. [10.1007/s00200-022-00586-z]
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.
