On the public citation graph

Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc

0 signed · 53 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.1007/3-540-44990-6_9openalex-snapshot
Reasoning about the Elementary Functions of Complex Analysis
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_4openalex-snapshot
An Overview of Semantics for the Validation of Numerical Programs
inferredcites →https://doi.org/10.1007/978-3-642-02614-0_14openalex-snapshot
Combined Decision Techniques for the Existential Theory of the Reals
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_9openalex-snapshot
Understanding Branch Cuts of Expressions
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/b105073openalex-snapshot
Verification, Model Checking, and Abstract Interpretation
inferredcites →https://doi.org/10.1007/b94790openalex-snapshot
Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, Venice, Italy, January 11-13, 2004 : proceedings
inferredcites →https://doi.org/10.1007/s00200-007-0052-yopenalex-snapshot
Testing elementary function identities using CAD
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.1023/a:1016007415899openalex-snapshot
Reasoning about the Elementary Functions of Complex Analysis
inferredcites →https://doi.org/10.1145/1093390.1093393openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
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/1940475.1940500openalex-snapshot
Geometry of branch cuts
inferredcites →https://doi.org/10.1145/235699.235705openalex-snapshot
The unwinding number
inferredcites →https://doi.org/10.1145/309831.309892openalex-snapshot
On projection in CAD-based quantifier elimination with equational constraint
inferredcites →https://doi.org/10.1145/362001.362023openalex-snapshot
“According to Abramowitz and Stegun” or arccoth needn't be uncouth
inferredcites →https://doi.org/10.1145/968708.968710openalex-snapshot
QEPCAD B
inferredcites →https://doi.org/10.2307/1266136openalex-snapshot
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
inferredcites →https://doi.org/10.48550/arxiv.1201.6439openalex-snapshot
A baby step-giant step roadmap algorithm for general algebraic sets

What points at this work

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

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-319-08434-3_5openalex-snapshot
Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-319-10515-4_4openalex-snapshot
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-42432-3_20openalex-snapshot
Need Polynomial Systems Be Doubly-Exponential?
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-642-39320-4_2openalex-snapshot
Optimising Problem Formulation for Cylindrical Algebraic Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-39320-4_9openalex-snapshot
Understanding Branch Cuts of Expressions
inferred← citeshttps://doi.org/10.1007/978-3-662-44199-2_65openalex-snapshot
Cylindrical Algebraic Decomposition in the RegularChains Library
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-662-44199-2_69openalex-snapshot
Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting
inferred← citeshttps://doi.org/10.1007/s11786-014-0191-zopenalex-snapshot
Cylindrical Algebraic Sub-Decompositions
inferred← citeshttps://doi.org/10.1007/s11786-019-00394-8openalex-snapshot
Using Machine Learning to Improve Cylindrical Algebraic Decomposition
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.11.002openalex-snapshot
Truth table invariant cylindrical algebraic decomposition
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.019openalex-snapshot
Cylindrical algebraic decomposition with equational constraints
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.003openalex-snapshot
An unwinding number pair for continuous expressions of integrals
inferred← citeshttps://doi.org/10.1109/synasc.2013.14openalex-snapshot
A "Piano Movers" Problem Reformulated
inferred← citeshttps://doi.org/10.1109/synasc.2014.15openalex-snapshot
Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition
inferred← citeshttps://doi.org/10.1109/synasc.2016.020openalex-snapshot
Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases
inferred← citeshttps://doi.org/10.1145/2465506.2465516openalex-snapshot
Cylindrical algebraic decompositions for boolean combinations
inferred← citeshttps://doi.org/10.1145/2644288.2644293openalex-snapshot
Branch cuts in maple 17
inferred← citeshttps://doi.org/10.1145/2755996.2756678openalex-snapshot
Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
inferred← citeshttps://doi.org/10.17863/cam.38371openalex-snapshot
Using Machine Learning to Decide when to Precondition Cylindrical Algebraic Decomposition with Groebner Bases
inferred← citeshttps://doi.org/10.48456/tr-884openalex-snapshot
Machine learning and computer algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1302.6401openalex-snapshot
An implementation of CAD in Maple utilising McCallum projection
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3062openalex-snapshot
An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06599openalex-snapshot
An implementation of Sub-CAD in Maple
inferred← citeshttps://doi.org/10.48550/arxiv.1906.01455openalex-snapshot
Algorithmically generating new algebraic features of polynomial systems for machine learning
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.