scientific article; zbMATH DE number 2151204
From MaRDI portal
Publication:4660671
zbMath1072.68693MaRDI QIDQ4660671
Éric Schost, Mohab Safey El Din
Publication date: 4 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems, A probabilistic algorithm for computing data-discriminants of likelihood equations, Generalized polar varieties: geometry and algorithms, Local polar varieties in the geometric study of singularities, Symbolic computation in hyperbolic programming, Real root finding for low rank linear matrices, On the complexity of the generalized MinRank problem, 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, 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, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, Early Ending in Homotopy Path-Tracking for Real Roots, Global optimization of polynomials restricted to a smooth variety using sums of squares, Real root finding for determinants of linear matrices, Variant quantifier elimination, Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity, Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Computing real radicals and \(S\)-radicals of polynomial systems, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Open weak CAD and its applications, Solving parametric piecewise polynomial systems, A hybrid procedure for finding real points on a real algebraic set, Solving parametric polynomial systems, Solving determinantal systems using homotopy techniques, Exact algorithms for semidefinite programs with degenerate feasible set, A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals, Multilinear polynomial systems: root isolation and bit complexity, Intrinsic complexity estimates in polynomial optimization, Certified non-conservative tests for the structural stability of discrete multidimensional systems, Computing totally real hyperplane sections and linear series on algebraic curves, On sign conditions over real multivariate polynomials, On the geometry of polar varieties, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, On exact Reznick, Hilbert-Artin and Putinar's representations, On types of degenerate critical points of real polynomial functions, Polar Varieties Revisited, The Voronoi diagram of three lines, A Survey of Satisfiability Modulo Theory, Unnamed Item, Exact Algorithms for Linear Matrix Inequalities, 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, Computing real witness points of positive dimensional polynomial systems
Uses Software
