Cylindrical algebraic decompositions for boolean combinations
From MaRDI portal
Publication:2963225
DOI10.1145/2465506.2465516zbMath1359.68327arXiv1304.7603OpenAlexW2113881937WikidataQ59590588 ScholiaQ59590588MaRDI QIDQ2963225
Matthew England, Scott McCallum, David J. Wilson, Russell J. Bradford, James H. Davenport
Publication date: 10 February 2017
Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7603
Related Items
Recent Advances in Real Geometric Reasoning, Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation), Lazard-style CAD and Equational Constraints, Cylindrical algebraic sub-decompositions, On using Lazard's projection in CAD construction, Using machine learning to improve cylindrical algebraic decomposition, Truth table invariant cylindrical algebraic decomposition, Need Polynomial Systems Be Doubly-Exponential?, Cylindrical algebraic decomposition with equational constraints, Quantifier elimination by cylindrical algebraic decomposition based on regular chains, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, 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, Special algorithm for stability analysis of multistable biological regulatory systems
Uses Software
