New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
From MaRDI portal
Publication:2109991
DOI10.1007/978-3-031-14788-3_17OpenAlexW4283706141MaRDI QIDQ2109991FDOQ2109991
Authors: Tereso del Río, Matthew England 
Publication date: 21 December 2022
Full work available at URL: https://arxiv.org/abs/2206.13480
Recommendations
- Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
- scientific article; zbMATH DE number 7339173
- Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks
- Optimising problem formulation for cylindrical algebraic decomposition
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
Cites Work
- Cylindrical algebraic decomposition in the RegularChains library
- Computing cylindrical algebraic decomposition via triangular decomposition
- Title not available (Why is that?)
- An incremental algorithm for computing cylindrical algebraic decompositions
- Optimising problem formulation for cylindrical algebraic decomposition
- Efficient projection orders for CAD
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- Truth table invariant cylindrical algebraic decomposition
- Validity proof of Lazard's method for CAD construction
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Fully incremental cylindrical algebraic decomposition
- Cylindrical algebraic decomposition with equational constraints
- Using machine learning to improve cylindrical algebraic decomposition
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Open non-uniform cylindrical algebraic decompositions
- Improving the use of equational constraints in cylindrical algebraic decomposition
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
- Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
- Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks
- Title not available (Why is that?)
- Applying machine learning to heuristics for real polynomial constraint solving
Cited In (7)
- Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
- Title not available (Why is that?)
- Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
- Constrained neural networks for interpretable heuristic creation to optimise computer algebra systems
- Exploring alternative machine learning models for variable ordering in cylindrical algebraic decomposition
- Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions
Uses Software
This page was built for publication: New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109991)
