scientific article; zbMATH DE number 6027001
From MaRDI portal
zbMath1249.14019MaRDI QIDQ5389777
Marc Giusti, Joos Heintz, Bernd Bank, Luis Miguel Pardo
Publication date: 23 April 2012
Full work available at URL: https://eudml.org/doc/33718
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Singularities in algebraic geometry (14B05) Real algebraic sets (14P05)
Related Items
Generalized polar varieties: geometry and algorithms, Faster real root decision algorithm for symmetric polynomials, Early Ending in Homotopy Path-Tracking for Real Roots, Real root finding for determinants of linear matrices, A concise proof of the Kronecker polynomial system solver from scratch, Variant quantifier elimination, Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, A hybrid procedure for finding real points on a real algebraic set, Homotopy techniques for solving sparse column support determinantal polynomial systems, Intrinsic complexity estimates in polynomial optimization, On sign conditions over real multivariate polynomials, On the geometry of polar varieties, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, On the intrinsic complexity of point finding in real singular hypersurfaces, Polar Varieties Revisited, Fast computation of a rational point of a variety over a finite field, Degeneracy loci and polynomial equation solving, Smooth points on semi-algebraic sets, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
Uses Software
Cites Work
- 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
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Definability and fast quantifier elimination in algebraically closed fields
- Lectures on results on Bezout's theorem. Notes by D. P. Patil
- Solving systems of polynomial inequalities in subexponential time
- Variétés polaires locales et classes de Chern des variétés singulieres
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- 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
- The hardness of polynomial equation solving
- Quadratic Newton iteration for systems with multiplicity
- Real solving for positive dimensional systems.
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Recent progress in intersection theory. Based on the international conference on intersection theory, Bologna, Italy, December 1997
- Generalized polar varieties: geometry and algorithms
- Complexity estimates depending on condition and round-off error
- Ideals defined by matrices and a certain complex associated with them
- Polar classes of singular varieties
- On the combinatorial and algebraic complexity of quantifier elimination
- R-SEQUENCES AND INDETERMINATES
- Sur la complexité du principe de Tarski-Seidenberg
- 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
