p-adic algorithm for bivariate Gröbner bases

DOI10.1145/3597066.3597086MaRDI QIDQ6081975

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

zbMATH Keywords

Gröbner basis \(p\)-adic algorithm primary components Hermite and Howell normal form

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

Unnamed Item
Unnamed Item
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
Solving bivariate systems using rational univariate representations
Topology and arrangement computation of semi-algebraic planar curves
Canonical Hilbert-Burch matrices for ideals of \(k[x,y\)]
On the asymptotic and practical complexity of solving bivariate systems over the reals
On constructing bases for ideals in polynomial rings over the integers
A p-adic approach to the computation of Gröbner bases
The membership problem for unmixed polynomial ideals is solvable in single exponential time
On lucky ideals for Gröbner basis computations
Solving zero-dimensional systems through the rational univariate representation
Lower bounds for diophantine approximations
Straight-line programs in geometric elimination theory
Modular algorithms for computing Gröbner bases.
Computing parametric geometric resolutions
Ideal basis and primary decompositions: case of two variables
Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
Bounds for polynomials on algebraic numbers and application to curve topology
Computing syzygies in finite dimension using fast linear algebra
On the complexity of computing with planar algebraic curves
An improved upper complexity bound for the topology computation of a real algebraic plane curve
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Modern Computer Algebra
Size of coefficients of lexicographical Groöbner bases
Rational univariate representations of bivariate systems and applications
On the complexity of solving bivariate systems
Some comments on the modular approach to Gröbner-bases
Improved algorithm for computing separating linear forms for bivariate systems
On improving approximate results of Buchberger's algorithm by Newton's method
Spans in the module (Z_m)^s
Sharp estimates for triangular sets
Sharp Effective Nullstellensatz
Change of Basis for m-primary Ideals in One and Two Variables
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
On the complexity of solving a bivariate polynomial system
Lifting techniques for triangular decompositions
Computer Algebra in Scientific Computing
On Solving Systems of Bivariate Polynomials
A Gröbner free alternative for polynomial system solving

This page was built for publication: p-adic algorithm for bivariate Gröbner bases