bokomslag Algorithmic Number Theory
Data & IT

Algorithmic Number Theory

Leonard M Adleman Ming-Deh Huang

Pocket

1009:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 320 sidor
  • 1994
This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994. The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding. Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.
  • Författare: Leonard M Adleman, Ming-Deh Huang
  • Format: Pocket/Paperback
  • ISBN: 9783540586913
  • Språk: Engelska
  • Antal sidor: 320
  • Utgivningsdatum: 1994-11-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K