Algorithms in real algebraic geometry
From MaRDI portal
Publication:5920628
DOI10.1007/3-540-33099-2zbMath1102.14041OpenAlexW4255213956MaRDI QIDQ5920628
Saugata Basu, Marie-Françoise Roy, Richard Pollack
Publication date: 13 September 2006
Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-33099-2
quantifier eliminationreal closed fieldscomplexity of algorithmsalgorithmic real algebraic geometryreal semi-algebraic sets
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Research exposition (monographs, survey articles) pertaining to algebraic geometry (14-02) Semialgebraic sets and related spaces (14P10) Computational aspects in algebraic geometry (14Q99)
Related Items (only showing first 100 items - show all)
Highly symmetric POVMs and their informational power ⋮ Geometric permutations of non-overlapping unit balls revisited ⋮ Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ A new general formula for the Cauchy index on an interval with subresultants ⋮ Measuring the local non-convexity of real algebraic curves ⋮ Measuring the constrained reachability in quantum Markov chains ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems ⋮ Interpolation and model checking for nonlinear arithmetic ⋮ Fraction-free unit circle stability tests ⋮ Metric properties of semialgebraic mappings ⋮ Space exploration via proximity search ⋮ Semidefinite programming and sums of Hermitian squares of noncommutative polynomials ⋮ Stabbing simplices by points and flats ⋮ Solving bivariate systems using rational univariate representations ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ Bounding the equivariant Betti numbers of symmetric semi-algebraic sets ⋮ On the solvability of derived matrix problems, including completions and duals ⋮ Random generation of periodic hard ellipsoids based on molecular dynamics: a computationally-efficient algorithm ⋮ Real ideal and the duality of semidefinite programming for polynomial optimization ⋮ Semi-algebraic functions have small subdifferentials ⋮ A constructive algebraic strategy for interpolatory subdivision schemes induced by bivariate box splines ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Alternating projections on nontangential manifolds ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ On real one-sided ideals in a free algebra ⋮ Revisiting Zariski main theorem from a constructive point of view ⋮ Tight bounds for rational sums of squares over totally real fields ⋮ Incidence bounds on multijoints and generic joints ⋮ Semi-algebraic Ramsey numbers ⋮ Representing simple \(d\)-dimensional polytopes by \(d\) polynomials ⋮ Computing isolated roots of sparse polynomial systems in affine space ⋮ Refined bounds on the number of connected components of sign conditions on a variety ⋮ Sphere and dot product representations of graphs ⋮ Faster \(p\)-adic feasibility for certain multivariate sparse polynomials ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces ⋮ Solving the implicitization, inversion and reparametrization problems for rational curves through subresultants ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Real root finding for determinants of linear matrices ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ CAD and topology of semi-algebraic sets ⋮ On the topology of real algebraic plane curves ⋮ Root isolation of zero-dimensional polynomial systems with linear univariate representation ⋮ Variant quantifier elimination ⋮ A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface ⋮ Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian ⋮ Computing the Fréchet distance between folded polygons ⋮ Application of Sturm theorem in the global controllability of a class of high dimensional polynomial systems ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces ⋮ An algorithm for determining copositive matrices ⋮ Real radical initial ideals ⋮ Linear solving for sign determination ⋮ Computational geometry of positive definiteness ⋮ Geodesic diameter of sets defined by few quadratic equations and inequalities ⋮ Uniqueness of equilibrium in the haber synthesis of ammonia ⋮ Segregation of stability domains of the Hamilton nonlinear system ⋮ Solving parametric piecewise polynomial systems ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ Divide and conquer roadmap for algebraic sets ⋮ The dimension of semialgebraic subdifferential graphs ⋮ On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials ⋮ A nonparametric analysis of multi-product oligopolies ⋮ Design of Marx generators as a structured eigenvalue assignment ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ A note on the complexity of real algebraic hypersurfaces ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ Quantifier elimination for a class of exponential polynomial formulas ⋮ Separating inequalities for nonnegative polynomials that are not sums of squares ⋮ A baby step-giant step roadmap algorithm for general algebraic sets ⋮ Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time ⋮ Counting multijoints ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Proving inequalities and solving global optimization problems via simplified CAD projection ⋮ A systematic approach for doing an a priori identifiability study of dynamical nonlinear models ⋮ Curvature of Hessian manifolds ⋮ Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis ⋮ Bivariate triangular decompositions in the presence of asymptotes ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ Tractability conditions for numeric CSPs ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Fixed points, Nash equilibria, and the existential theory of the reals ⋮ On the complexity of minimizing probabilistic and quantum automata ⋮ Elementary recursive quantifier elimination based on Thom encoding and sign determination ⋮ Direct symbolic transformation from 3D Cartesian into hyperboloidal coordinates ⋮ An algebraic certificate for Budan's theorem ⋮ Evaluating geometric queries using few arithmetic operations ⋮ An algebraic approach to continuous collision detection for ellipsoids ⋮ Solution formulas for cubic equations without or with constraints ⋮ Applications of dimensionality reduction and exponential sums to graph automorphism ⋮ Some new results on decidability for elementary algebra and geometry ⋮ A Szemerédi-Trotter type theorem in \(\mathbb R^4\) ⋮ Stress matrices and global rigidity of frameworks on surfaces ⋮ Quadratic growth and critical point stability of semi-algebraic functions ⋮ On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems ⋮ A worst-case bound for topology computation of algebraic curves ⋮ Multi-letter quantum finite automata: decidability of the equivalence and minimization of states ⋮ Algebraic varieties are homeomorphic to varieties defined over number fields
Uses Software
This page was built for publication: Algorithms in real algebraic geometry
