A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
From the reviews:
H. Cohen
A Course in Computational Algebraic Number Theory
"With numerous advances in mathematics, computer science, and cryptography, algorithmic number theory has become an important subject. Undoubtedly, this book, written by one of the leading authorities in the field, is one of the most beautiful books available on the market."
―ACTA SCIENTIARUM MATHEMATICARUM
“This book is intended to provide material for a three-semester sequence, introductory, graduate course in computational algebraic number theory. ... The book is excellent. ... The book has 75 sections, making it suitable for a three-semester sequence. There are numerous exercises at all levels ... . The bibliography is quite comprehensive and therefore has intrinsic value in its own right. ... chapters bring the student to the frontiers of the field, covering elliptic curves, modern primality testing and modern factoring methods.” (Russell Jay Hendel, The Mathematical Association of America, January, 2011)
A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 5,00 für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerAnbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Hardcover. 4. print. XX, 551 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. X-15826 3540556400 Sprache: Deutsch Gewicht in Gramm: 1100. Bestandsnummer des Verkäufers 2391776
Anzahl: 1 verfügbar
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
gebundene Ausgabe. Zustand: Gut. 545 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. In ENGLISCHER Sprache. Einbandkanten etwas fleckig. Sprache: Englisch Gewicht in Gramm: 950. Bestandsnummer des Verkäufers 2128547
Anzahl: 1 verfügbar
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Zustand: Good. Volume 138. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1100grams, ISBN:9783540556404. Bestandsnummer des Verkäufers 5581051
Anzahl: 1 verfügbar
Anbieter: Powell's Bookstores Chicago, ABAA, Chicago, IL, USA
Zustand: Used - Very Good. 1993. hardcover. Cloth, no dj. Minor scuffing and edge wear to boards. Former owner's signature on front paste down and ffep. Else a bright, clean copy. Very Good. Bestandsnummer des Verkäufers SON000061370
Anzahl: 1 verfügbar
Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes Königreich
Cloth. Zustand: Very Good. Second Corrected Printing. Type: Book Signature inside cover, slight fading to spine. Bestandsnummer des Verkäufers 060270
Anzahl: 1 verfügbar
Anbieter: Mooney's bookstore, Den Helder, Niederlande
Zustand: Very good. Bestandsnummer des Verkäufers 9783540556404-2-2
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Immediate bestselling graduate textbookA description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The firs. Bestandsnummer des Verkäufers 4893680
Anzahl: Mehr als 20 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book describes 148 algorithms which are fundamental for number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters lead the reader to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations. The last three chapters give a survey of factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The book ends with a description of available computer packages and some useful tables. The book also contains a large number of exercises. Written by an authority in the field, and one with great practical and teaching experience it is sure to become the standard and indispensable reference on the subject. 580 pp. Englisch. Bestandsnummer des Verkäufers 9783540556404
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - With the advent of powerful computing tools and numerous advances in math ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc . Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature. Bestandsnummer des Verkäufers 9783540556404
Anzahl: 1 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Buch. Zustand: Neu. Neuware -With the advent of powerful computing tools and numerous advances in math ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc . Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 580 pp. Englisch. Bestandsnummer des Verkäufers 9783540556404
Anzahl: 2 verfügbar