Daniel Richardson
- D. Arnon and S. MacAllum, A polynomia.1 time algorithm for the topological type of a real algebraic curve, 3. of Synlbolic CoInp 5, 1988 Google Scholar
Digital Library
- R. Bianconi, Some results in the model theory of analytic functions, Ph.D. thesis, Oxford, 1990Google Scholar
- J. Bochnak, M. Coste and M. F. Roy, Geometric Algebrique Reelte, Ergebnisse vol 12, Springer-Verlag, 1987Google Scholar
- M. Coste, Effective semialgebraic geometry, Rennes M Coste and M.F. Roy, Thom's lemma, the Coding of real algebraic numbers and the computation of the topology of semi-algebraic sets, J. Symbolic Computtion, 5, 121-129, 1988 Google ScholarDigital Library
- J. H. Davenport, Computer algebra for cylindric a.1- gebraic decomposition, TRITA-NA-8511, NADA, KTIt, Stockholm 1985Google Scholar
- L. Gonzalez, H. Lombardi, T. Recio and M.F. Roy, Sturm-Habicht Sequence, ISSAC 89 Google ScholarDigital Library
- P. Milne, On the Algorithms and Implementation of a Geometric Algebra System, Ph.D. Thesis, University of Bath 1985 Google ScholarDigital Library
- P. Pedersen, Generalizing Sturm's theorem to N dimensions, New York University, Dept of Computer Science, Courant Institute, April 1990Google Scholar
- D. Richardson, Finding roots of equations involving solutions of first order algebraic differential equatio~Ls, Proceedings of conference of Effective Methods in Algebraic Geometry, MEGA 1990Google Scholar
- D.Richardson, Wu's method and the Khovanskii finiteness theorem, to appear in Journal of Symbolic Computation Google ScholarDigital Library
- D. Richardson, Computing (in a bounded part of the plane) the topology of a real curve defined by solutions of algebraic differential equations, submitted for publicationGoogle Scholar
- M. F. Roy , Computation of the topology of a real curve, Proceedings of the conference on computatic,nal geometry and topology, Sevilla 1987Google Scholar
- M.F. Roy and A. Szpirglas, Complexity of computations of cylindrical decomposition and topology of real algebraic curves using Thom's lemma, Proceedings of the conference on Real Algebraic Geometry, Trento 1988Google Scholar
- J. Shackell, Growth estimates for exp-log functions, to appear in Journa.1 of Symbolic Computation Google ScholarDigital Library
- L. van den Dries, On the elementary theory of restricted elementary functions, J. Symb. Logic 53, 7'96- 808, 1988Google ScholarCross Ref
- Van Den Dries, Lou and J. Denef, P-adic and real subanalytic sets, Annals of Mathematics, 128 (1988), pp 79-138Google ScholarCross Ref
- N.N. Vorobjov, Deciding consistency of systems of polynomial in exponent inequalities in subexponential time, Proceedings of MEGA 90, 1990Google Scholar
- A.J. Wilkie, Some model completeness results for expansions of the ordered field of real numbers by Pfaffian functions, preprint, Mathematics Institute, OxfordGoogle Scholar
Index Terms
- Towards computing non algebraic cylindrical decompositions
Recommendations
Angular decompositions for the discrete fractional signal transforms
This paper is concerned with the angular decomposition methods for the discrete fractional signal transforms. The proposed angular decomposition algorithm can be applied to many discrete fractional signal transforms, which are developed by eigen ...
Computing cylindrical algebraic decomposition via triangular decomposition
ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computationCylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an arbitrary ...
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theory. This means that the algorithms are not derived by manipulating the entries of ...
Comments