A Computational Introduction to Number Theory and Algebra
by Victor Shoup
Publisher: Cambridge University Press 2005
ISBN/ASIN: 0521851548
ISBN-13: 9780521851541
Number of pages: 534
Description:
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The mathematical prerequisites are minimal: nothing beyond material in a typical undergraduate course in calculus is presumed, other than some experience in doing proofs - everything else is developed from scratch.
Download or read it online for free here:
Download link
(3.5MB, PDF)
Similar books
Axiom: The Scientific Computation Systemby Richard D. Jenks, Robert S. Sutor - axiom-developer.org
Axiom is a free general purpose computer algebra system. The book gives a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms developed by the symbolic computation community, and presents advanced techniques.
(25907 views)
Algorithms in Real Algebraic Geometryby S. Basu, R. Pollack, M. Roy - Springer
The monograph gives a detailed exposition of the algorithmic real algebraic geometry. It is well written and will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.
(20687 views)
Think Stats: Probability and Statistics for Programmersby Allen B. Downey - Green Tea Press
Think Stats is an introduction to Probability and Statistics for Python programmers. This new book emphasizes simple techniques you can use to explore real data sets and answer interesting statistical questions. Basic skills in Python are assumed.
(26657 views)
An Architecture for Combinator Graph Reductionby Philip J. Koopman, Jr. - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
(19947 views)