๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

A course in computational number theory

โœ Scribed by David M Bressoud; S Wagon

Publisher
Wiley
Year
2000
Tongue
English
Leaves
383
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Course in Computational Number Theory
๐Ÿ“ A Course in Computational Number Theory
โœ David Bressoud, Stan Wagon ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Wiley ๐ŸŒ English

A Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for wor

A Course in Computational Number Theory
๐Ÿ“ A Course in Computational Number Theory
โœ David Bressoud, Stan Wagon ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Wiley ๐ŸŒ English

A Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for wor

A Course in Computational Number Theory
๐Ÿ“ A Course in Computational Number Theory
โœ David Bressoud, Stan Wagon ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Wiley ๐ŸŒ English

<i>A Course in Computational Number Theory</i> uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms

A Course in Computational Algebraic Numb
๐Ÿ“ A Course in Computational Algebraic Number Theory
โœ Henri Cohen ๐Ÿ“‚ Library ๐Ÿ“… 1996 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English

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

A course in computational algebraic numb
๐Ÿ“ A course in computational algebraic number theory
โœ Henri Cohen ๐Ÿ“‚ Library ๐Ÿ“… 1993 ๐Ÿ› Springer ๐ŸŒ English

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