Polar varieties, real equation solving, and data structures: the hypersurface case
From MaRDI portal
Publication:1361872
DOI10.1006/jcom.1997.0432zbMath0872.68066arXivalg-geom/9609004OpenAlexW2134386365MaRDI QIDQ1361872
G. M. Mbakop, Marc Giusti, Bernd Bank, Joos Heintz
Publication date: 28 July 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/alg-geom/9609004
Related Items
Generalized polar varieties: geometry and algorithms, Local polar varieties in the geometric study of singularities, Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics, Faster real root decision algorithm for symmetric polynomials, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, Refined bounds on the number of connected components of sign conditions on a variety, Global optimization of polynomials restricted to a smooth variety using sums of squares, Real root finding for determinants of linear matrices, A concise proof of the Kronecker polynomial system solver from scratch, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field, Deformation techniques for efficient polynomial equation solving., Estimates on the number of \(\mathbb{F}_q\)-rational solutions of variants of diagonal equations over finite fields, On sign conditions over real multivariate polynomials, On the geometry of polar varieties, On the intrinsic complexity of point finding in real singular hypersurfaces, On types of degenerate critical points of real polynomial functions, Polar Varieties Revisited, Unnamed Item, Fast computation of a rational point of a variety over a finite field, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity, Systems of rational polynomial equations have polynomial size approximate zeros on the average, Computing real witness points of positive dimensional polynomial systems
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
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Complexity of computation on real algebraic numbers
- The complexity of elementary algebra and geometry
- Solving systems of polynomial inequalities in subexponential time
- Résolution des systèmes d'équations algébriques
- Factoring polynomials with rational coefficients
- Variétés polaires locales et classes de Chern des variétés singulieres
- The complexity of partial derivatives
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Complexity of deciding Tarski algebra
- Complexity of Bezout's theorem. V: Polynomial time
- Straight-line programs in geometric elimination theory
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Algorithms in algebraic geometry and applications. Proceedings of the MEGA-94 conference, Santander, Spain, April 5-9, 1994
- Complexity of Bezout's theorem. III: Condition number and packing
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Boolean circuits versus arithmetic circuits
- Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination]
- Complexity of Bezout's Theorem I: Geometric Aspects
- Constructions in Algebra
- On the combinatorial and algebraic complexity of quantifier elimination
- Sur la complexité du principe de Tarski-Seidenberg
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- On the Betti Numbers of Real Varieties
