L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLes informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Frais de port :
EUR 3
De Irlande vers France
Description du livre Etat : New. 2000. 1st ed. 1993. 4th printing 2000. Hardcover. . . . . . N° de réf. du vendeur V9783540556404
Description du livre Gebunden. Etat : 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. N° de réf. du vendeur 4893680
Description du livre Etat : new. N° de réf. du vendeur FrontCover3540556400
Description du livre Hardcover. Etat : new. Prompt service guaranteed. N° de réf. du vendeur Clean3540556400
Description du livre Hardcover. Etat : new. New. N° de réf. du vendeur Wizard3540556400
Description du livre Etat : new. N° de réf. du vendeur newMercantile_3540556400
Description du livre Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N° de réf. du vendeur ria9783540556404_lsuk
Description du livre Buch. Etat : 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. N° de réf. du vendeur 9783540556404
Description du livre Hardcover. Etat : new. N° de réf. du vendeur 9783540556404
Description du livre Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783540556404