On the intrinsic complexity of point finding in real singular hypersurfaces
From MaRDI portal
(Redirected from Publication:990944)
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
Cites work
- scientific article; zbMATH DE number 4180200 (Why is no real title available?)
- scientific article; zbMATH DE number 17838 (Why is no real title available?)
- scientific article; zbMATH DE number 1568888 (Why is no real title available?)
- Algorithms in real algebraic geometry
- Constraint Databases
- Generalized polar varieties and an efficient real elimination.
- Generalized polar varieties: geometry and algorithms
- Polar classes of singular varieties
- Polar varieties and efficient real elimination
- Polar varieties, real equation solving, and data structures: the hypersurface case
- 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
- The hardness of polynomial equation solving
Cited in
(9)- 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
- scientific article; zbMATH DE number 17838 (Why is no real title available?)
- On the geometry of polar varieties
- On tangent lines to affine hypersurfaces
- 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
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)
