Computational Number Theory: Proceedings of the Colloquium on Computational Number Theory Held at Kossuth Lajos University, Debrecen (Hungary), Sep (Library Binding)

~ Michael E. Pohst (Editor), Attila Petho (Editor), Hugh C. Williams (Editor) "The purpose of this survey is to present some recent results of the authors on finding fast algorithms for the construction of primitive elements, normal..." (more)
Key Phrases: index form equations, primitive normal basis, ring class group, New York, Walter de Gruyter, Computational Number Theory (more...)

Editorial Reviews

Product Description

The volume is devoted to the interaction of modern scientific computation and classical number theory. The contributions, ranging from effective finiteness results to efficient algorithms in elementary, analytical and algebraic number theory, provide a broad view of the methods and results encountered in the new and rapidly developing area of computational number theory. Topics covered include finite fields, quadratic forms, number fields, modular forms, elliptic curves and diophantine equations. In addition, two new number theoretical software packages, KANT and SIMATH, are described in detail with emphasis on algorithms in algebraic number theory.

Product Details

• Library Binding: 342 pages
• Publisher: Walter de Gruyter (June 1991)
• Language: English
• ISBN-10: 3110123940
• ISBN-13: 978-3110123944
• Product Dimensions: 9.5 x 7 x 0.9 inches
• Shipping Weight: 1.5 pounds (View shipping rates and policies)
• Average Customer Review: No customer reviews yet. Be the first.
• Amazon.com Sales Rank: #6,523,597 in Books (See Bestsellers in Books)