Optimising Problem Formulation for Cylindrical Algebraic Decomposition
From MaRDI portal
Publication:2843003
DOI10.1007/978-3-642-39320-4_2zbMath1390.68775arXiv1304.7222OpenAlexW3098210831WikidataQ59590589 ScholiaQ59590589MaRDI QIDQ2843003
Matthew England, Russell J. Bradford, David J. Wilson, James H. Davenport
Publication date: 9 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7222
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs, Recent Advances in Real Geometric Reasoning, Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition, Cylindrical algebraic sub-decompositions, 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?, Cylindrical algebraic decomposition with equational constraints, 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, Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure, Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness, New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
Uses Software
