Häftad, Engelska, 1994
Del i serien Lecture Notes in Computer Science
Algorithmic Number Theory
First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings
Av Leonard M. Adleman, Ming-Deh Huang
719 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Finns i fler format
Beskrivning
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.
Produktinformation
- Utgivningsdatum: 1994-11-15
- Mått: 216 x 279 x 19 mm
- Vikt: 517 g
- Format: Häftad
- Språk: Engelska
- Serie: Lecture Notes in Computer Science
- Antal sidor: 320
- Upplaga: 1994
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN: 9783540586913
Utforska kategorier
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.