6 citations · 11 across the 5 of their papers we have counts for
5 papers
A Poly-algorithmic Approach to Quantifier Elimination
James H. Davenport, Zak P. Tonks, Ali K. Uncu
Cylindrical Algebraic Decomposition (CAD) was the first practical means for doing real quantifier elimination (QE), and is still a major method, with many improvements since Collin…
New Opportunities for the Formal Proof of Computational Real Geometry?
Erika {Á}brahám, James Davenport, Matthew England +2
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked be…
On Fast Matrix Inversion via Fast Matrix Multiplication
Zak Tonks
Volker Strassen first suggested an algorithm to multiply matrices with worst case running time less than the conventional operations in 1969. He also presented a…
Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics
C. Mulligan, R. Bradford, J. H. Davenport +2
We consider problems originating in economics that may be solved automatically using mathematical software. We present and make freely available a new benchmark set of such problem…
Quantifier Elimination for Reasoning in Economics
Casey B. Mulligan, Russell Bradford, James H. Davenport +2
We consider the use of Quantifier Elimination (QE) technology for automated reasoning in economics. QE dates back to Tarski's work in the 1940s with software to perform it dating t…