scientific article; zbMATH DE number 939802
From MaRDI portal
zbMath0879.14033MaRDI QIDQ4714011
Eberhard Becker, Thorsten Wörmann, M. Emilia Alonso García, Marie-Françoise Roy
Publication date: 25 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
idempotentsGröbner basiscomputational methodsmultiplicitieszero-dimensional idealzero-dimensional systems
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of algebraic curves (14Q05)
Related Items
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Complexity results for triangular sets, Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\), Polynomial equation solving by lifting procedures for ramified fibers, Modular composition modulo triangular sets and applications, Exact symbolic-numeric computation of planar algebraic curves, Elimination ideal and bivariate resultant over finite fields, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, Real root finding for determinants of linear matrices, A concise proof of the Kronecker polynomial system solver from scratch, An FGLM-like algorithm for computing the radical of a zero-dimensional ideal, Root isolation of zero-dimensional polynomial systems with linear univariate representation, Segre-driven radicality testing, Bit-size estimates for triangular sets in positive dimension, A generic position based method for real root isolation of zero-dimensional polynomial systems, The complexity of computing all subfields of an algebraic number field, Solving determinantal systems using homotopy techniques, Homotopy techniques for solving sparse column support determinantal polynomial systems, A Gröbner free alternative for polynomial system solving, Improved explicit estimates on the number of solutions of equations over a finite field, On sign conditions over real multivariate polynomials, Probabilistic algorithms for computing resolvent representations of regular differential ideals, Block-Krylov techniques in the context of sparse-FGLM algorithms, On types of degenerate critical points of real polynomial functions, An algorithm for implicit interpolation, A modular method to compute the rational univariate representation of zero-dimensional ideals, Deformation techniques for sparse systems, Evaluation techniques for zero-dimensional primary decomposition, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Computing critical points for invariant algebraic systems
