Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
From MaRDI portal
Publication:431820
DOI10.1007/s10208-011-9112-6zbMath1246.14071MaRDI QIDQ431820
Luis Miguel Pardo, Marc Giusti, Lutz Lehmann, Joos Heintz, Bernd Bank
Publication date: 3 July 2012
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-011-9112-6
singularities; degree of varieties; intrinsic complexity; polar and bipolar varieties; real polynomial solving
68W30: Symbolic computation and algebraic computation
14B05: Singularities in algebraic geometry
14P05: Real algebraic sets
14B07: Deformations of singularities
Related Items
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field, Degeneracy loci and polynomial equation solving, 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
- 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
- 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
- Evaluation techniques for zero-dimensional primary decomposition
- Solving systems of polynomial inequalities in subexponential time
- Variétés polaires locales et classes de Chern des variétés singulieres
- Effective Łojasiewicz inequalities in semialgebraic geometry
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- 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
- Computing parametric geometric resolutions
- Quadratic Newton iteration for systems with multiplicity
- Real solving for positive dimensional systems.
- Deformation techniques for efficient polynomial equation solving.
- On the geometry of polar varieties
- Generalized polar varieties: geometry and algorithms
- A concise proof of the Kronecker polynomial system solver from scratch
- Polar classes of singular varieties
- On the combinatorial and algebraic complexity of quantifier elimination
- Le rôle des structures de données dans les problèmes d'élimination
- Polars of real singular curves
- The Geometrical Invariants of Algebraic Loci
- The Arithmetical 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
