Course in computational algebraic number theory / [by] Henri Cohen.

By:

Cohen, Henri

Material type: Text

TextLanguage: ENG Series: Graduate texts in mathematics ; 138Publication details: Berlin ; New York : Springer, 1996.Edition: 3rd edDescription: xx, 551 p. : ill. ; 24 cmISBN:

9783540556404 (hbk):

Subject(s):

DDC classification:

23rd 512.7 COH/C

LOC classification:

QA247 .C55 1996

Online resources:

Publisher description

Summary: Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Barcode
Reference Book	Transit Campus Mathematics	512.7 COH/C (Browse shelf(Opens below))	Available	001996
Books	Vigyanpuri Campus Mathematics	512.7 COH/C (Browse shelf(Opens below))	Available	003788
Books	Vigyanpuri Campus Mathematics	512.7 COH/C (Browse shelf(Opens below))	Available	001997

Browsing Vigyanpuri Campus shelves, Shelving location: Mathematics Close shelf browser (Hides shelf browser)

Previous								Next
Previous	512.7 BRU/1 The 1-2-3 of modular forms : lectures at a summer school in Nordfjordeid, Norway /	512.7 COH/A Advanced topics in computational number theory /	512.7 COH/A Advanced number theory/	512.7 COH/C Course in computational algebraic number theory /	512.7 COH/C Course in computational algebraic number theory /	512.7 DRM/S Sequences, discrepancies and applications/	512.7 DRM/S Sequences, discrepancies and applications/	Next

Includes bibliographical references (p. [527]-539) and index.

Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate.

There are no comments on this title.

to post a comment.