Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity

DOI10.1090/S0025-5718-2013-02766-4zbMath1281.68239OpenAlexW2052496602MaRDI QIDQ2871188

Joos Heintz, Marc Giusti, Bernd Bank

Publication date: 22 January 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02766-4

zbMATH Keywords

singularitiespolarintrinsic complexitydegree of varietyreal polynomial equation solvingcopolar and bipolar varieties

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Singularities in algebraic geometry (14B05) Real algebraic sets (14P05) Parallel algorithms in computer science (68W10) Deformations of singularities (14B07)

Related Items

Bit complexity for computing one point in each connected component of a smooth real algebraic set, Computing real witness points of positive dimensional polynomial systems

Uses Software

• Kronecker

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
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
• 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
• On the intrinsic complexity of point finding in real singular hypersurfaces
• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• Solving systems of polynomial inequalities in subexponential time
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier 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
• Software engineering and complexity in effective algebraic geometry
• On the geometry of a theorem of Riemann
• On the geometry of polar varieties
• Generalized polar varieties: geometry and algorithms
• A concise proof of the Kronecker polynomial system solver from scratch
• On the combinatorial and algebraic complexity of quantifier elimination
• Sur la complexité du principe de Tarski-Seidenberg
• On the intrinsic complexity of elimination problems in effective algebraic geometry
• The Arithmetical Invariants of Algebraic Loci
• The Geometrical Invariants of Algebraic Loci
• La serie canonica e la teoria delle serie principali di gruppi di punti sopra una superficie algebrica
• Algorithms in real algebraic geometry
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving
• Polar varieties and efficient real elimination