Smooth points on semi-algebraic sets
From MaRDI portal
Publication:2100053
DOI10.1016/j.jsc.2022.09.003zbMath1505.14123OpenAlexW3006522207WikidataQ115996760 ScholiaQ115996760MaRDI QIDQ2100053
Jonathan D. Hauenstein, Katherine M. Harris, Agnes Szanto
Publication date: 21 November 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2022.09.003
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isosingular sets and deflation
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
- On the generic and typical ranks of 3-tensors
- A zero-dimensional approach to compute real radicals
- On the intrinsic complexity of point finding in real singular hypersurfaces
- Solving systems of polynomial inequalities in subexponential time
- Computation of generalized real radicals of polynomial ideals
- Complexity of computing the local dimension of a semialgebraic set
- Computation of real radicals of polynomial ideals. II
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Sharp estimates for the arithmetic Nullstellensatz
- Real solving for positive dimensional systems.
- Numerically computing real points on algebraic sets
- On real typical ranks
- On the geometry of polar varieties
- Degeneracy loci and polynomial equation solving
- Testing sign conditions on a multivariate polynomial and applications
- Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets
- Finding points on real solution components and applications to differential polynomial systems
- Critical Point Computations on Smooth Varieties
- Algorithm 921
- Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case
- Locating and Counting Equilibria of the Kuramoto Model with Rank-One Coupling
- Bit complexity for critical point computation in smooth and compact real hypersurfaces
- On the Complexity of Computing Real Radicals of Polynomial Systems
- Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Triangular decomposition of semi-algebraic systems
- Algorithms in real algebraic geometry
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
This page was built for publication: Smooth points on semi-algebraic sets
