scientific article; zbMATH DE number 2151204
From MaRDI portal
Publication:4660671
Recommendations
- Polar varieties and efficient real elimination
- Polar, bipolar and copolar varieties: real solving of algebraic varieties with intrinsic complexity
- Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Smooth points on semi-algebraic sets
Cited in
(69)- The Voronoi diagram of three lines
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Open weak CAD and its applications
- A hybrid procedure for finding real points on a real algebraic set
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Real solving for positive dimensional systems.
- Multilinear polynomial systems: root isolation and bit complexity
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Smooth points on semi-algebraic sets
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems
- Real root finding for low rank linear matrices
- Computing real radicals and S-radicals of polynomial systems
- Solving determinantal systems using homotopy techniques
- Intrinsic complexity estimates in polynomial optimization
- On the geometry of polar varieties
- On types of degenerate critical points of real polynomial functions
- Computing real witness points of positive dimensional polynomial systems
- Generalized polar varieties: geometry and algorithms
- Solving parametric polynomial systems
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- Permutations encoding the local shape of level curves of real polynomials via generic projections
- Polar varieties revisited
- A survey of satisfiability modulo theory
- Exact algorithms for linear matrix inequalities
- Critical point computations on smooth varieties, degree and complexity bounds
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- On the complexity of the generalized MinRank problem
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Variant quantifier elimination
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Local polar varieties in the geometric study of singularities
- Symbolic computation in hyperbolic programming
- scientific article; zbMATH DE number 797449 (Why is no real title available?)
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
- Computing totally real hyperplane sections and linear series on algebraic curves
- Smooth points on semi-algebraic sets
- Generalized polar varieties and an efficient real elimination.
- Polar, bipolar and copolar varieties: real solving of algebraic varieties with intrinsic complexity
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- Polar varieties and efficient real elimination
- Stability analysis of a bacterial growth model through computer algebra
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities
- Refined F5 Algorithms for Ideals of Minors of Square Matrices
- Faster real root decision algorithm for symmetric polynomials
- Early Ending in Homotopy Path-Tracking for Real Roots
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Solving parametric piecewise polynomial systems
- On types of isolated KKT points in polynomial optimization
- Computing the dimension of real algebraic sets
- Faster one block quantifier elimination for regular polynomial systems of equations
- Certifying solutions of degenerate semidefinite programs
- On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
- Solving parameter-dependent semi-algebraic systems
- Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
- Sampling smooth points on real algebraic sets using perturbations
- Solving generic parametric linear matrix inequalities
- Computing roadmaps in unbounded smooth real algebraic sets. II: Algorithm and complexity
- Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set
- Solving parametric linear matrix inequalities
- Real root finding for determinants of linear matrices
- On sign conditions over real multivariate polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660671)
