The complexity of quantifier elimination and cylindrical algebraic decomposition
From MaRDI portal
Recommendations
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Partial cylindrical algebraic decomposition for quantifier elimination
- On the combinatorial and algebraic complexity of quantifier elimination
- scientific article; zbMATH DE number 3880114
Cited in
(60)- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Using machine learning to improve cylindrical algebraic decomposition
- A logic based approach to finding real singularities of implicit ordinary differential equations
- On algorithms testing positivity of real symmetric polynomials
- Formula simplification via invariance detection by algebraically indexed types
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- The saddle point problem of polynomials
- Cylindrical algebraic decomposition with equational constraints
- Single-factor coefficient bounds
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
- Need polynomial systems be doubly-exponential?
- The complexity of cylindrical algebraic decomposition with respect to polynomial degree
- Adapting real quantifier elimination methods for conflict set computation
- Recent advances in real geometric reasoning
- scientific article; zbMATH DE number 1263359 (Why is no real title available?)
- On the combinatorial and algebraic complexity of quantifier elimination
- Cylindrical algebraic sub-decompositions
- Quantifier elimination for a class of exponential polynomial formulas
- Proving inequalities and solving global optimization problems via simplified CAD projection
- Computing linear extensions for polynomial posets subject to algebraic constraints
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
- Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs
- Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic Decomposition
- Complexity of quantifier elimination in the theory of ordinary differential equations
- Counterexamples to quantifier elimination for fewnomial and exponential expressions
- Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
- Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition
- Constraint Markov chains
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Simple CAD construction and its applications
- Complexity of cylindrical decompositions of sub-Pfaffian
- Truth table invariant cylindrical algebraic decomposition
- A Unified Approach to Unimodality of Gaussian Polynomials
- Faster real root decision algorithm for symmetric polynomials
- Digital collections of examples in mathematical sciences
- Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
- Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?
- CAD and topology of semi-algebraic sets
- Introducing asynchronicity to probabilistic hyperproperties
- An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search
- Exploring alternative machine learning models for variable ordering in cylindrical algebraic decomposition
- Constrained neural networks for interpretable heuristic creation to optimise computer algebra systems
- Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD
- Supporting proving and discovering geometric inequalities in GeoGebra by using Tarski
- Recent developments in real quantifier elimination and cylindrical algebraic decomposition (extended abstract of invited talk)
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions
- Iterated resultants and rational functions in real quantifier elimination
- Quantifier elimination for normal cone computations
- Quantitative approximate definable choices
- All saddle points for polynomial optimization
- Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices
- Solving parameter-dependent semi-algebraic systems
- A geometric approach to cylindrical algebraic decomposition
- Quantifier elimination over the integers
- Breaking the data barrier in learning symbolic computation: a case study on variable ordering suggestion for cylindrical algebraic decomposition
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
This page was built for publication: The complexity of quantifier elimination and cylindrical algebraic decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301651)
