On the intrinsic complexity of point finding in real singular hypersurfaces

DOI10.1016/J.IPL.2009.07.014zbMATH Open1206.68136OpenAlexW2106340839MaRDI QIDQ990944FDOQ990944

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

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

Recommendations

• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
• On the bit complexity of finding points in connected components of a smooth real hypersurface
• Bit complexity for critical point computation in smooth and compact real hypersurfaces
• A note on the complexity of real algebraic hypersurfaces
• Computing the real isolated points of an algebraic hypersurface
• The Computational Complexity of the Resolution of Plane Curve Singularities
• On the polyhedral complexity of the integer points in a hyperball
• Critical point computations on smooth varieties, degree and complexity bounds
• An upper estimate of integral points in real simplices with an application to singularity theory

zbMATH Keywords

computational complexitysingular hypersurfacereal polynomial equation solving

Mathematics Subject Classification ID

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

Cites Work

• Algorithms in real algebraic geometry
• The hardness of polynomial equation solving
• Solving systems of polynomial inequalities in subexponential time
• Polar varieties, real equation solving, and data structures: the hypersurface case
• Generalized polar varieties: geometry and algorithms
• Generalized polar varieties and an efficient real elimination.
• Polar classes of singular varieties
• Title not available (Why is that?)
• Polar varieties and efficient real elimination
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constraint Databases

Cited In (8)

• Smooth points on semi-algebraic sets
• 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
• Title not available (Why is that?)
• On the geometry of polar varieties
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Faster real root decision algorithm for symmetric polynomials
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity

Uses Software

• RAGlib

This page was built for publication: On the intrinsic complexity of point finding in real singular hypersurfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990944)