Skip to main content
SpringerLink
Log in

Complexity of quantifier elimination in the theory of ordinary differential equations

  • Invited Papers
  • Conference paper
  • First Online:
Book cover Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.L.Chistov, D.Yu.Grigor'ev. Solving systems of algebraic equations in subexponential time I, II. — Preprints LOMI, E-9-83, E-10-83, Leningrad, 1983.

    Google Scholar 

  2. A.L. Chistov, D.Yu. Grigor'ev. Complexity of quantifier elimination in the theory of algebraically closed fields. — Lect.Notes Comput. Sci., 1984, v.176, p.17–31.

    Google Scholar 

  3. D.Yu.Grigor'ev. Complexity of quantifier elimination in the theory of ordinary differential equations. — Proc.VIII All-Union conf. Math.Logic, Moscow, 1986, p.46 (in Russian).

    Google Scholar 

  4. D.Yu.Grigor'ev. Computational Complexity in Polynomial Algebra. — Proc.International Congress of Mathematicians, 1987, Berkeley.

    Google Scholar 

  5. D.Yu. Grigor'ev, A.L. Chistov. Fast decomposition of polynomials into irreducible ones and the solution of systems of algebraic equations. — Soviet Math.Dokl., 1984, v.29, p.380–383.

    Google Scholar 

  6. J. Heintz. Definability and fast quantifier elimination in algebraically closed fields. — Theor.Comput.Sci., 1983, v.24, p.239–278.

    Article  Google Scholar 

  7. E.R.Kolchin. Differential algebra and algebraic groups. — Academic Press, 1973.

    Google Scholar 

  8. D. Lazard. Resolution des systemes d'equations algebriques. — Theor. Comput.Sci., 1981, v.15, p.77–110.

    Article  Google Scholar 

  9. A. Seidenberg. An elimination theory for differential algebra. — Univ.of Calif.Press, 1956, v.3, N 2, p.31–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad Department of Mathematical V.A.Steklov, Institute of Academy of Sciences of the USSR, Fontanka 27, 191011, Leningrad, USSR

    D.Yu. Grigor'ev

Authors
  1. D.Yu. Grigor'ev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grigor'ev, D. (1989). Complexity of quantifier elimination in the theory of ordinary differential equations. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation