Обложка книги Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)

Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)

,

ISBN: 0262024055; 9780262024051;
Издательство: The MIT Press
Страниц: 528

"[ Algorithmic Number Theory ] is an enormous achievement and an extremely valuable reference." -- Donald E. Knuth, Emeritus, Stanford University Algorithmic Number Theory provides a thorough introduction to the design and analysis of algorithms for problems from the theory of numbers. Although not an elementary textbook, it includes over 300 exercises with suggested solutions. Every theorem not proved in the text or left as an exercise has a reference in the notes section that appears atthe end of each chapter. The bibliography contains over 1,750 citations to the literature. Finally, it successfully blends computational theory with practice by covering some of the practical aspects of algorithm implementations. The subject of algorithmic number theory represents the marriage of number theory with the theory of computational complexity. It may be briefly defined as finding integer solutions to equations, or proving their non-existence, making efficient use of...