Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
From MaRDI portal
Recommendations
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- On the intrinsic complexity of point finding in real singular hypersurfaces
- scientific article; zbMATH DE number 3978403
- On the bit complexity of finding points in connected components of a smooth real hypersurface
- Critical point computations on smooth varieties, degree and complexity bounds
- Computational complexity of fixed points and intersection points
- Complexity of intersections of real quadrics and topology of symmetric determinantal varieties
- Computing the real isolated points of an algebraic hypersurface
- On the polyhedral complexity of the integer points in a hyperball
- scientific article; zbMATH DE number 1023365
Cites work
- A concise proof of the Kronecker polynomial system solver from scratch
- A Gröbner free alternative for polynomial system solving
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Algorithms in real algebraic geometry
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Bipolar varieties and real solving of a singular polynomial equation
- Definability and fast quantifier elimination in algebraically closed fields
- Generalized polar varieties and an efficient real elimination.
- Generalized polar varieties: geometry and algorithms
- scientific article; zbMATH DE number 4154415 (Why is no real title available?)
- scientific article; zbMATH DE number 3937310 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1027930 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 1148276 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- scientific article; zbMATH DE number 3227205 (Why is no real title available?)
- scientific article; zbMATH DE number 3031899 (Why is no real title available?)
- Kronecker's smart, little black boxes
- La serie canonica e la teoria delle serie principali di gruppi di punti sopra una superficie algebrica
- Lectures on results on Bezout's theorem. Notes by D. P. Patil
- Lower bounds for diophantine approximations
- On the combinatorial and algebraic complexity of quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the geometry of a theorem of Riemann
- On the geometry of polar varieties
- On the intrinsic complexity of elimination problems in effective algebraic geometry
- On the intrinsic complexity of point finding in real singular hypersurfaces
- On the time-space complexity of geometric elimination procedures
- Polar varieties and efficient real elimination
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Software engineering and complexity in effective algebraic geometry
- Solving systems of polynomial inequalities in subexponential time
- Straight-line programs in geometric elimination theory
- Sur la complexité du principe de Tarski-Seidenberg
- The Arithmetical Invariants of Algebraic Loci
- The Geometrical Invariants of Algebraic Loci
- The hardness of polynomial equation solving
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
Cited in
(8)- Efficient computation of dual space and directional multiplicity of an isolated point
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Intrinsic complexity estimates in polynomial optimization
- Computing real witness points of positive dimensional polynomial systems
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Explicit estimates for polynomial systems defining irreducible smooth complete intersections
- Dedicated to the memory of Joos Heintz
- On the intrinsic complexity of point finding in real singular hypersurfaces
This page was built for publication: Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871188)
