skip to content
Algorithms in algebraic number theory Preview this item
ClosePreview this item
Checking...

Algorithms in algebraic number theory

Author: H W Lenstra; American Mathematical Society.
Publisher: Providence, RI : American Mathematical Society, [2008?], ©1992.
Series: AMS progress in mathematics lecture series.
Edition/Format:   VHS video : Videodisc : VHS tape   Visual material : EnglishView all editions and formats
Database:WorldCat
Summary:
Algorithms in algebraic number theory are as old as the field itself. Traditionally, the users of such algorithms were number theorists needing to do computations in algebraic number fields. However, recent applications, such as factoring large integers, have changed this situation. Lenstra presents a clear, well-paced, and fascinating lecture on some of the fundamental questions arising in this area. He formulates  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Videorecording
Document Type: Visual material
All Authors / Contributors: H W Lenstra; American Mathematical Society.
ISBN: 0821844091 9780821844090
OCLC Number: 285420197
Event notes: Lecture given at the 94th summer meeting of the American Mathematical Society, University of Maine, Orono, Maine, Aug. 8-10, 1991.
Target Audience: Accessible to advanced undergraduates and graduate students with background in algebra and number theory.
Description: 1 videodisc (ca. 90 min.) : sd., col. ; 4 3/4 in.
Series Title: AMS progress in mathematics lecture series.
Responsibility: H. W. Lenstra.

Abstract:

Algorithms in algebraic number theory are as old as the field itself. Traditionally, the users of such algorithms were number theorists needing to do computations in algebraic number fields. However, recent applications, such as factoring large integers, have changed this situation. Lenstra presents a clear, well-paced, and fascinating lecture on some of the fundamental questions arising in this area. He formulates the basic problems of algorithmic algebraic number theory in rigorous terms, discussing advances and unsolved questions. The main topic of the lecture is the investigation of the multiplicative structure of rings of algebraic integers, the principal tool being a group that simultaneously describes the class group and the group of units of such a ring. Lenstra shows that the study of algorithms not only increases understanding of algebraic number fields, but also stimulates curiosity about them. For this reason, the lecture would be an excellent addition to a course touching on these topics. It is accessible to advanced undergraduates and graduate students with backgrounds in algebra and number theory.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/285420197>
library:oclcnum"285420197"
library:placeOfPublication
library:placeOfPublication
rdf:typebgn:VHS
rdf:typeschema:Movie
schema:about
schema:about
schema:about
schema:contentRating"Accessible to advanced undergraduates and graduate students with background in algebra and number theory."
schema:contributor
schema:contributor
schema:datePublished""
schema:description"Algorithms in algebraic number theory are as old as the field itself. Traditionally, the users of such algorithms were number theorists needing to do computations in algebraic number fields. However, recent applications, such as factoring large integers, have changed this situation. Lenstra presents a clear, well-paced, and fascinating lecture on some of the fundamental questions arising in this area. He formulates the basic problems of algorithmic algebraic number theory in rigorous terms, discussing advances and unsolved questions. The main topic of the lecture is the investigation of the multiplicative structure of rings of algebraic integers, the principal tool being a group that simultaneously describes the class group and the group of units of such a ring. Lenstra shows that the study of algorithms not only increases understanding of algebraic number fields, but also stimulates curiosity about them. For this reason, the lecture would be an excellent addition to a course touching on these topics. It is accessible to advanced undergraduates and graduate students with backgrounds in algebra and number theory."
schema:exampleOfWork<http://worldcat.org/entity/work/id/501243456>
schema:inLanguage"en"
schema:isPartOf
schema:name"Algorithms in algebraic number theory"
schema:publication
schema:publisher
schema:workExample
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.