On the intrinsic complexity of point finding in real singular hypersurfaces

DOI10.1016/j.ipl.2009.07.014zbMath1206.68136OpenAlexW2106340839MaRDI QIDQ990944

Joos Heintz, Luis Miguel Pardo, Bernd Bank, Marc Giusti

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://edoc.hu-berlin.de/18452/3459

zbMATH Keywords

computational complexitysingular hypersurfacereal polynomial equation solving

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Faster real root decision algorithm for symmetric polynomials, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Smooth points on semi-algebraic sets, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity

Uses Software

• RAGlib

Cites Work

• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• Solving systems of polynomial inequalities in subexponential time
• Polar varieties, real equation solving, and data structures: the hypersurface case
• The hardness of polynomial equation solving
• Generalized polar varieties: geometry and algorithms
• Polar classes of singular varieties
• Constraint Databases
• Algorithms in real algebraic geometry
• Polar varieties and efficient real elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item