Algorithms in real algebraic geometry
Algorithms in real algebraic geometry (scientific article; zbMATH DE number 5053270)
algorithmic real algebraic geometrycomplexity of algorithmsquantifier eliminationreal closed fieldsreal semi-algebraic sets
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) Symbolic computation and algebraic computation (68W30)
This is the second edition of the monograph of the same authors [Algorithms in Real Algebraic Geometry, Springer, Berlin (2003; Zbl 1031.14028)], which appears due to high interest and large demand by researchers working in the field and related areas. Main changes made by the authors in the second edition, intend to improve presentation as a teaching source. In particular, the cylindrical decomposition algorithm and the real root counting have been made independent on some advanced technical polynomial computation, and respectively, these topics appear in the book earlier. Among new topics included in the book are normal polynomials and virtual roots, discriminants of symmetric matrices, computation of the first Betti number of a semi-algebraic set in a single-exponential time. The updated bibliography reflects the last years achievements in computational real algebraic geometry.
- On the number of topological types occurring in a parameterized family of arrangements
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves
- Auxetic deformations and elliptic curves
- A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Source localization and denoising: a perspective from the TDOA space
- Matroids over partial hyperstructures
- Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL
- Lengths of developments in \(K((G))\)
- Global optimization of polynomials over real algebraic sets
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Anderson localization for two interacting quasiperiodic particles
- Density of algebraic points on Noetherian varieties
- The complexity of dominating set in geometric intersection graphs
- Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications
- Orderability and Dehn filling
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Univariate real root isolation in an extension field and applications
- \(L^3\) estimates for an algebraic variable coefficient Wolff circular maximal function
- On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
- Real closures of models of weak arithmetic
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Efficient evaluation of specific queries in constraint databases
- Analyticity of the planar limit of a matrix model
- Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
- On solving parametric polynomial systems
- Numerically computing real points on algebraic sets
- Tropical spectrahedra
- Imaginary projections of polynomials
- On sum of squares certificates of non-negativity on a strip
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Parametrized homology via zigzag persistence
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Using machine learning to improve cylindrical algebraic decomposition
- Characteristic polynomials of symmetric matrices over the univariate polynomial ring
- Tools for analyzing the intersection curve between two quadrics through projection and lifting
- Invariant coordinate subspaces of normal form of a system of ordinary differential equations
- A local maximizer for lattice width of 3-dimensional hollow bodies
- Semialgebraic sets and real binary forms decompositions
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves
- Solutions to a system of equations for \(C^m\) functions
- Generators for the \(C^m\)-closures of ideals
- Efficiently and effectively recognizing toricity of steady state varieties
- Tournament quasirandomness from local counting
- Graph reconstruction from unlabeled edge lengths
- VC density of definable families over valued fields
- Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials
- First-order orbit queries
- The impact on the properties of the EFGM copulas when extending this family
- Correction to: ``Tropical varieties for exponential sums
- The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- Sampling polynomial trajectories for LTL verification
- Revisiting reachability in polynomial interrupt timed automata
- Subset selection for matrices with fixed blocks
- On tameness of zonoids
- On algorithms testing positivity of real symmetric polynomials
- An algebraic method to fidelity-based model checking over quantum Markov chains
- On the equality of periods of Kontsevich-Zagier
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Interactions of zeros of polynomials and multiplicity matrices
- Smooth points on semi-algebraic sets
- Computing critical points for invariant algebraic systems
- Half-trek criterion for identifiability of latent variable models
- Quantitative curve selection lemma
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Bounds for polynomials on algebraic numbers and application to curve topology
- Model checking QCTL plus on quantum Markov chains
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems
- Level lines of a polynomial on a plane
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials
- Disguised toric dynamical systems
- When a system of real quadratic equations has a solution
- Describing amoebas
- Complexity of linear relaxations in integer programming
- Algebraic degrees of 3-dimensional polytopes
- An approximate characterisation of the set of feasible trajectories for constrained flat systems
- On the Reeb spaces of definable maps
- On generalizing Descartes' rule of signs to hypersurfaces
- Real root finding for low rank linear matrices
- Numerical roadmap of smooth bounded real algebraic surface
- Generically globally rigid graphs have generic universally rigid frameworks
- Separation bounds for polynomial systems
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Tropical combinatorial Nullstellensatz and sparse polynomials
- On \(\epsilon\)-sensitive monotone computations
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Invariance of a class of semi-algebraic sets for polynomial systems with dynamic compensators
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Parameterization of a set determined by the generalized discriminant of a polynomial
- Computation of the fundamental units of number rings using a generalized continued fraction
- Equivalence checking of quantum finite-state machines
- A condition for multiplicity structure of univariate polynomials
- On the sensitivity of the optimal partition for parametric second-order conic optimization
This page was built for publication: Algorithms in real algebraic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920628)