Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals

Let A , B ∈ K [ X , Y ] be two bivariate polynomials over an effective field K , and let G be the reduced Gröbner basis of the ideal I : = ⟨ A , B ⟩ generated by A and B with respect to the usual degree lexicographic order. Assuming A and B sufficiently generic, we design a quasi-optimal algorithm f...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applicable algebra in engineering, communication and computing communication and computing, 2019-12, Vol.30 (6), p.509-539
Hauptverfasser:	van der Hoeven, Joris, Larrieu, Robin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Artificial Intelligence Bivariate analysis Computational Complexity Computer Hardware Computer Science Mathematical Software Multiplication Original Paper Polynomials Quotients Reduction Symbolic and Algebraic Manipulation Symbolic Computation Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!