Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1987: Fundamentals of Computation Theory pp 301Cite as

Diophantine complexity

  • Conference paper
  • First Online:

  • 140 Accesses

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

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

References

  1. Matiyasevich Yu.V. Diphantine sets. Russian Math.Surveys 27 (1972), no.5, 124–164.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad Branch Steklov Institute of Mathematics, 27, Fontanka, 191011, Leningrad, USSR

    Yu. Matijasevich

Authors
  1. Yu. Matijasevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matijasevich, Y. (1987). Diophantine complexity. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation