On the public citation graph

Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1006/jsco.2001.0463openalex-snapshot
Improved Projection for Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/3-540-15984-3_235openalex-snapshot
The SAC-2 computer algebra system
inferredcites →https://doi.org/10.1007/3-540-15984-3_275openalex-snapshot
Gröbner bases using SAC2
inferredcites →https://doi.org/10.1007/3-540-33099-2openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-319-08434-3_5openalex-snapshot
Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
inferredcites →https://doi.org/10.1007/978-3-319-08434-3_8openalex-snapshot
Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/978-3-319-10515-4_4openalex-snapshot
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
inferredcites →https://doi.org/10.1007/978-3-319-32859-1_21openalex-snapshot
Efficient Subformula Orders for Real Quantifier Elimination of Non-prenex Formulas
inferredcites →https://doi.org/10.1007/978-3-319-42432-3_20openalex-snapshot
Need Polynomial Systems Be Doubly-Exponential?
inferredcites →https://doi.org/10.1007/978-3-319-45641-6_12openalex-snapshot
The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
inferredcites →https://doi.org/10.1007/978-3-642-31374-5_19openalex-snapshot
Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases
inferredcites →https://doi.org/10.1007/978-3-642-32347-8_1openalex-snapshot
MetiTarski: Past and Future
inferredcites →https://doi.org/10.1007/978-3-642-39320-4_2openalex-snapshot
Optimising Problem Formulation for Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/978-3-662-44199-2_44openalex-snapshot
Real Quantifier Elimination in the RegularChains Library
inferredcites →https://doi.org/10.1007/978-3-662-44199-2_68openalex-snapshot
Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_12openalex-snapshot
An Improved Projection Operation for Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_4openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/s10817-014-9301-5openalex-snapshot
Machine Learning for First-Order Theorem Proving
inferredcites →https://doi.org/10.1016/0001-8708(82)90048-2openalex-snapshot
The complexity of the word problems for commutative semigroups and polynomial ideals
inferredcites →https://doi.org/10.1016/0005-2795(75)90109-9openalex-snapshot
Comparison of the predicted and observed secondary structure of T4 phage lysozyme
inferredcites →https://doi.org/10.1016/j.jsc.2005.09.007openalex-snapshot
Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
inferredcites →https://doi.org/10.1016/j.jsc.2005.09.011openalex-snapshot
Algorithmic methods for investigating equilibria in epidemic modeling
inferredcites →https://doi.org/10.1016/j.jsc.2006.06.004openalex-snapshot
Cylindrical Algebraic Decomposition using validated numerics
inferredcites →https://doi.org/10.1016/j.jsc.2015.11.002openalex-snapshot
Truth table invariant cylindrical algebraic decomposition
inferredcites →https://doi.org/10.1016/j.jsc.2015.11.008openalex-snapshot
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
inferredcites →https://doi.org/10.1016/s0747-7171(08)80152-6openalex-snapshot
Partial Cylindrical Algebraic Decomposition for quantifier elimination
inferredcites →https://doi.org/10.1016/s0747-7171(88)80004-xopenalex-snapshot
Real quantifier elimination is doubly exponential
inferredcites →https://doi.org/10.1017/cbo9780511809682openalex-snapshot
Kernel Methods for Pattern Analysis
inferredcites →https://doi.org/10.1023/a:1022643204877openalex-snapshot
Induction of Decision Trees
inferredcites →https://doi.org/10.1093/bioinformatics/16.5.412openalex-snapshot
Assessing the accuracy of prediction algorithms for classification: an overview
inferredcites →https://doi.org/10.1109/cdc.2005.1582743openalex-snapshot
Nonlinear parametric optimization using cylindrical algebraic decomposition
inferredcites →https://doi.org/10.1109/synasc.2012.68openalex-snapshot
Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc
inferredcites →https://doi.org/10.1109/tkde.2003.1245283openalex-snapshot
Benchmarking attribute selection techniques for discrete class data mining
inferredcites →https://doi.org/10.1137/0213054openalex-snapshot
Cylindrical Algebraic Decomposition I: The Basic Algorithm
inferredcites →https://doi.org/10.1145/1005285.1005303openalex-snapshot
Efficient projection orders for CAD
inferredcites →https://doi.org/10.1145/1277548.1277557openalex-snapshot
The complexity of quantifier elimination and cylindrical algebraic decomposition
inferredcites →https://doi.org/10.1145/1576702.1576718openalex-snapshot
Computing cylindrical algebraic decomposition via triangular decomposition
inferredcites →https://doi.org/10.1145/1577190.1577203openalex-snapshot
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
inferredcites →https://doi.org/10.1145/1656274.1656278openalex-snapshot
The WEKA data mining software
inferredcites →https://doi.org/10.1145/2429135.2429137openalex-snapshot
A repository for CAD examples
inferredcites →https://doi.org/10.1145/2465506.2465516openalex-snapshot
Cylindrical algebraic decompositions for boolean combinations
inferredcites →https://doi.org/10.1145/2465506.2465952openalex-snapshot
Constructing a single open cell in a cylindrical algebraic decomposition
inferredcites →https://doi.org/10.1145/2608628.2608633openalex-snapshot
Cylindrical algebraic decomposition using local projections
inferredcites →https://doi.org/10.1145/2608628.2608676openalex-snapshot
Constructing fewer open cells by GCD computation in CAD projection
inferredcites →https://doi.org/10.1145/2755996.2756678openalex-snapshot
Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1145/96877.96943openalex-snapshot
An improvement of the projection operator in cylindrical algebraic decomposition
inferredcites →https://doi.org/10.7551/mitpress/4057.001.0001openalex-snapshot
Kernel Methods in Computational Biology

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← backgroundhttps://doi.org/10.5281/zenodo.343885zenodo-depositor-declared
Dataset Supporting "Using Machine Learning To Decide When To Precondition Cylindrical Algebraic Decomposition With Groebner Bases"
inferred← citeshttps://doi.org/10.1007/978-3-030-23250-4_7openalex-snapshot
Comparing Machine Learning Models to Choose the Variable Ordering for Cylindrical Algebraic Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-43120-4_27openalex-snapshot
Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
inferred← citeshttps://doi.org/10.1007/978-3-030-52200-1_29openalex-snapshot
Applying Machine Learning to Heuristics for Real Polynomial Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-64529-7_19openalex-snapshot
Constrained Neural Networks for Interpretable Heuristic Creation to Optimise Computer Algebra Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-45641-6_12openalex-snapshot
The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
inferred← citeshttps://doi.org/10.1007/978-3-319-96418-8_20openalex-snapshot
Machine Learning for Mathematical Software
inferred← citeshttps://doi.org/10.1007/978-3-319-96418-8_55openalex-snapshot
Polynomial Constraints and Unsat Cores in Tarski
inferred← citeshttps://doi.org/10.1007/s11786-019-00394-8openalex-snapshot
Using Machine Learning to Improve Cylindrical Algebraic Decomposition
inferred← citeshttps://doi.org/10.1007/s11786-024-00591-0openalex-snapshot
Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CAD
inferred← citeshttps://doi.org/10.1090/mcom/4099openalex-snapshot
A geometric approach to cylindrical algebraic decomposition
inferred← citeshttps://doi.org/10.1109/synasc61333.2023.00013openalex-snapshot
A Poly-algorithmic Approach to Quantifier Elimination
inferred← citeshttps://doi.org/10.4236/ojapps.2022.1211132openalex-snapshot
Solve the Polynomial Functions Conditional Extreme by Applying the Groebner Basis Method
inferred← citeshttps://doi.org/10.4236/ojdm.2023.133008openalex-snapshot
Solving the k-Independent Sets Problem of Graphs by Gröbner Bases
inferred← citeshttps://doi.org/10.5194/gmd-16-6433-2023openalex-snapshot
Machine learning for numerical weather and climate modelling: a review
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.