On improving approximate results of Buchberger's algorithm by Newton's method

DOI10.1145/1089389.1089392zbMath0563.12024OpenAlexW2080183299MaRDI QIDQ3676239

Wolfgang Trinks

Publication date: 1984

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1089389.1089392

zbMATH Keywords

polynomial equationsBuchberger's algorithmconstructive Galois theoryp-adic splitting of polynomials

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Equations in general fields (12E12) Algorithms in computer science (68W99)

Related Items (10)

Realization of the Mathieu groups \(M_{11}\) and \(M_{12}\) as Galois groups over \({\mathbb Q})\). ⋮ Complexity results for triangular sets ⋮ Some examples for solving systems of algebraic equations by calculating Gröbner bases ⋮ A p-adic approach to the computation of Gröbner bases ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ On radical zero-dimensional ideals ⋮ Certain orthogonal and symplectic groups as Galois groups over \(\mathbb{Q}\) ⋮ Detecting algebraic curves in bad position ⋮ Floating point Gröbner bases. ⋮ AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES

This page was built for publication: On improving approximate results of Buchberger's algorithm by Newton's method