Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
From MaRDI portal
Publication:2819754
DOI10.1145/2755996.2756678zbMath1346.68283arXiv1501.04466OpenAlexW1983787096WikidataQ59590568 ScholiaQ59590568MaRDI QIDQ2819754
Matthew England, James H. Davenport, Russell J. Bradford
Publication date: 29 September 2016
Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.04466
Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Kac-Rice formulas and the number of solutions of parametrized systems of polynomial equations, Proving an execution of an algorithm correct?, Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings, The multistationarity structure of networks with intermediates and a binomial core network, Using machine learning to improve cylindrical algebraic decomposition, Identifying the parametric occurrence of multiple steady states for some biological networks, Truth table invariant cylindrical algebraic decomposition, Need Polynomial Systems Be Doubly-Exponential?, Fully incremental cylindrical algebraic decomposition, Cylindrical algebraic decomposition with equational constraints, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
