Algorithms in real algebraic geometry
From MaRDI portal
Publication:5906950
zbMath1031.14028MaRDI QIDQ5906950
Marie-Françoise Roy, Saugata Basu, Richard Pollack
Publication date: 16 July 2003
Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)
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)
On the Betti numbers of sign conditions ⋮ Reasoning about probabilistic sequential programs ⋮ Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries ⋮ SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving ⋮ The resultant, the discriminant, and the derivative of generalized Fibonacci polynomials ⋮ Geometric Path Integrals. A Language for Multiscale Biology and Systems Robustness ⋮ Unit Distances in Three Dimensions ⋮ On maps which preserve semipositivity and quantifier elimination theory for real numbers ⋮ NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ The differential of probabilistic entailment ⋮ On Ray Shooting for Triangles in 3-Space and Related Problems ⋮ Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning ⋮ The anisotropic part of a quadratic form over a number field ⋮ Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics ⋮ Machine learning the real discriminant locus ⋮ \texttt{PTOPO}: computing the geometry and the topology of parametric curves ⋮ Multistationarity and bistability for fewnomial chemical reaction networks ⋮ The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Regular cylindrical algebraic decomposition ⋮ Linear slices of hyperbolic polynomials and positivity of symmetric polynomial functions ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Planar Convex Codes are Decidable ⋮ Quantifier elimination theory and maps which preserve semipositivity ⋮ Avoiding the general position condition when computing the topology of a real algebraic plane curve defined implicitly ⋮ ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION ⋮ Curves testing boundedness of polynomials on subsets of the real plane ⋮ Realization Theory for Discrete-Time Semi-algebraic Hybrid Systems ⋮ Determination of the limits for multivariate rational functions ⋮ A geometric model of an arbitrary differentially closed field of characteristic zero ⋮ A delineability-based method for computing critical sets of algebraic surfaces ⋮ Determination of the tangents for a real plane algebraic curve ⋮ On the frontiers of polynomial computations in tropical geometry ⋮ Delocalization properties at isolated avoided crossings in Lipkin–Meshkov–Glick type Hamiltonian models ⋮ CATEGORICAL COMPLEXITY ⋮ Computing the asymptotes for a real plane algebraic curve ⋮ Bounds for the geodesic diameter of connection components of semi-algebraic open sets ⋮ A moment approach to analyze zeros of triangular polynomial sets ⋮ Unnamed Item ⋮ I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra ⋮ Unnamed Item ⋮ Rigidity for sticky discs ⋮ On the complexity of real root isolation using continued fractions ⋮ An explicit solution to Post's problem over the reals ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Topology of real algebraic space curves ⋮ Note on scalar curvature of extremal Kähler metrics on \(\mathbb{C} P^2 \# 2 \overline{\mathbb{C} P^2}\) ⋮ Complexity of solving parametric polynomial systems ⋮ Switching and stability properties of conewise linear systems ⋮ Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets ⋮ Polynomial systems with few real zeroes ⋮ The adjacency graph of a real algebraic surface ⋮ Minimizing polynomials via sum of squares over the gradient ideal ⋮ Robust global optimization with polynomials ⋮ On the complexity of the resolvent representation of some prime differential ideals ⋮ A note on optimization with Morse polynomials ⋮ Extremal polynomials in Smale's mean value conjecture ⋮ Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ A new approach to characterizing the relative position of two ellipses depending on one parameter ⋮ Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping ⋮ Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic ⋮ Unnamed Item ⋮ Explicit factors of some iterated resultants and discriminants ⋮ Temporalization of Probabilistic Propositional Logic ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ The Approach of Moments for Polynomial Equations ⋮ Rational univariate reduction via toric resultants ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ On the computational complexity of decision problems about multi-player Nash equilibria ⋮ Two logical hierarchies of optimization problems over the real numbers ⋮ Effective de Rham cohomology — The general case ⋮ Existence, Stability, and Symmetry of Relative Equilibria with a Dominant Vortex ⋮ Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image ⋮ Parts of quantum states ⋮ Combining Equational Reasoning ⋮ Crossing patterns of semi-algebraic sets ⋮ Polynomial Learning of Distribution Families ⋮ Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints ⋮ Fixed points of the EM algorithm and nonnegative rank boundaries ⋮ Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions ⋮ Real or natural number interpretation and their effect on complexity ⋮ Towards semantic mathematical editing ⋮ Exogenous Probabilistic Computation Tree Logic ⋮ Three-monotone interpolation ⋮ Multilevel polynomial partitions and simplified range searching ⋮ Almost linear Nash groups ⋮ Algorithms to compute the topology of orientable real algebraic surfaces ⋮ Faster geometric algorithms via dynamic determinant computation ⋮ Affine equivalences of trigonometric curves ⋮ A heuristic prover for real inequalities ⋮ Bezout matrices, subresultant polynomials and parameters ⋮ An introduction to multiscale techniques in the theory of Anderson localization. I ⋮ Computing the Betti numbers of arrangements via spectral sequences ⋮ On the polynomial Wolff axioms ⋮ Automatic computation of the complete root classification for a parametric polynomial ⋮ Mixed preferential attachment model: homophily and minorities in social networks ⋮ Computing with quadratic forms over number fields ⋮ Interlacing families. III: Sharper restricted invertibility estimates ⋮ Detecting rigid convexity of bivariate polynomials ⋮ Computing uniformly optimal strategies in two-player stochastic games
Uses Software
This page was built for publication: Algorithms in real algebraic geometry
