A concise proof of the Kronecker polynomial system solver from scratch
From MaRDI portal
Publication:2427141
DOI10.1016/j.exmath.2007.07.001zbMath1134.14317OpenAlexW2058786070MaRDI QIDQ2427141
Clémence Durvye, Grégoire Lecerf
Publication date: 8 May 2008
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.exmath.2007.07.001
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of higher-dimensional varieties (14Q15)
Related Items
Effective approximation of the solutions of algebraic equations, On the complexity exponent of polynomial system solving, Algorithm for Connectivity Queries on Real Algebraic Curves, Segre-driven radicality testing, Computing real radicals and \(S\)-radicals of polynomial systems, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Relaxed algorithms for \(p\)-adic numbers, On the bit complexity of polynomial system solving, Fast computation of generic bivariate resultants, Intrinsic complexity estimates in polynomial optimization, Deterministic normal position transformation and its applications, A parametric representation of totally mixed Nash equilibria, A geometric index reduction method for implicit systems of differential algebraic equations, On Bézout inequalities for non-homogeneous polynomial ideals, An algorithm for implicit interpolation, Kronecker, Deformation techniques for sparse systems, Evaluation techniques for zero-dimensional primary decomposition, Generators of the ideal of an algebraic space curve, Segre class computation and practical applications, Degeneracy loci and polynomial equation solving, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
Uses Software
Cites Work
- Polynomial equation solving by lifting procedures for ramified fibers
- Deformation techniques to solve generalised Pham systems
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Deformation techniques for sparse systems
- Applied algebra, algebraic algorithms and error-correcting codes. 6th international conference, AAECC-6, Rome, Italy, July 4-8, 1988. Proceedings
- Probabilistic algorithms for geometric elimination
- Lower bounds for diophantine approximations
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Straight-line programs in geometric elimination theory
- Foveal detection and approximation for singularities.
- The hardness of polynomial equation solving
- Computing parametric geometric resolutions
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- The distribution of condition numbers of rational data of bounded bit length
- Effective equidimensional decomposition of affine varieties
- Functional programming concepts and straight-line programs in computer algebra
- Quadratic Newton iteration for systems with multiplicity
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- The computational complexity of the Chow form
- On the intrinsic complexity of the arithmetic Nullstellensatz
- Deformation techniques for efficient polynomial equation solving.
- On the efficiency of effective Nullstellensätze
- Lifting and recombination techniques for absolute factorization
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Improved dense multivariate polynomial factorization algorithms
- Improved explicit estimates on the number of solutions of equations over a finite field
- Computing Chow Forms and Some Applications
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Fast computation of a rational point of a variety over a finite field
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- The intrinsic complexity of parametric elimination methods
- Le rôle des structures de données dans les problèmes d'élimination
- Probabilistic equidimensional decomposition
- Complexity issues in bivariate polynomial factorization
- Using Algebraic Geometry
- Modular equations for hyperelliptic curves
- On the time-space complexity of geometric elimination procedures
- A Gröbner free alternative for polynomial system solving
- Kronecker's and Newton's approaches to solving: a first comparison
- Polar varieties and efficient real elimination
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
