A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)

DOI10.1145/3594252.3594253OpenAlexW4366493540MaRDI QIDQ6110916

Tateaki Sasaki

Publication date: 2 August 2023

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Cramer-type formula for the polynomial solutions of coupled linear equations with polynomial coefficients
• Theory of multiple polynomial remainder sequence
• A p-adic approach to the computation of Gröbner bases
• Modular algorithms for computing Gröbner bases.
• A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
• Usage of modular techniques for efficient computation of ideal operations
• Resolution of singularities of an algebraic variety over a field of characteristic zero. II
• On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
• A subresultant-like theory for Buchberger's procedure
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Enhancing the Extended Hensel Construction by Using Gröbner Bases
• Solving Parametric Sparse Linear Systems by Local Blocking
• The Subresultant PRS Algorithm
• Polynomial Remainder Sequences and Determinants
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)