An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
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 theorem on refining division orders by the reverse lexicographic order
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
Efficient computation of zero-dimensional Gröbner bases by change of ordering
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
Sharp estimates for the arithmetic Nullstellensatz
Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
Directed evaluation
Computing syzygies in finite dimension using fast linear algebra
On the complexity of computing with planar algebraic curves
On the complexity of the \(F_5\) Gröbner basis algorithm
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
Parallelization of modular algorithms
On an extension of Galligo's theorem concerning the Borel-fixed points on the Hilbert scheme
Bad Primes in Computational Algebraic Geometry
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
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
Sharp estimates for triangular sets
Sharp Effective Nullstellensatz
Composition Modulo Powers of Polynomials
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
Computer Algebra in Scientific Computing
On Solving Systems of Bivariate Polynomials
A Gröbner free alternative for polynomial system solving
p-adic algorithm for bivariate Gröbner bases

This page was built for publication: An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650574)