Items related to Algorithmic Number Theory, Vol. 1: Efficient Algorithms...
Synopsis
Algorithmic Number Theory provides a thorough introduction to the design and analysisof algorithms for problems from the theory of numbers. Although not an elementary textbook, itincludes over 300 exercises with suggested solutions. Every theorem not proved in the text or leftas an exercise has a reference in the notes section that appears at the end of each chapter. Thebibliography contains over 1,750 citations to the literature. Finally, it successfully blendscomputational theory with practice by covering some of the practical aspects of algorithmimplementations.The subject of algorithmic number theory represents the marriage of number theorywith the theory of computational complexity. It may be briefly defined as finding integer solutionsto equations, or proving their non-existence, making efficient use of resources such as time andspace. Implicit in this definition is the question of how to efficiently represent the objects inquestion on a computer. The problems of algorithmic number theory are important both for theirintrinsic mathematical interest and their application to random number generation, codes forreliable and secure information transmission, computer algebra, and other areas.Publisher's Note:Volume 2 was not written. Volume 1 is, therefore, a stand-alone publication.
"synopsis" may belong to another edition of this title.
About the Author
Eric Bach is Professor, Computer Sciences Department, University of Wisconsin. Jeffrey Shallit is Associate Professor, Department of Computer Science, University of Waterloo.
"About this title" may belong to another edition of this title.
Search results for Algorithmic Number Theory, Vol. 1: Efficient Algorithms...
Seller Image
Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)
Seller: Zoom Books Company, Lynden, WA, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. Book is in good condition and may include underlining highlighting and minimal wear. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. Seller Inventory # ZBV.0262024055.G
Quantity: 1 available
Stock Image
Algorithmic Number Theory, Vol. 1: Efficient Algorithms
Published by
The MIT Press, Cambridge, 1996
ISBN 10: 0262024055
ISBN 13: 9780262024051
Used
Hardcover
Seller: Daedalus Books, Portland, OR, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Remainder mark on fore-edge. A nice, bright copy. ; Foundations Of Computing; 9.1 X 7.2 X 1.4 inches; 512 pages. Seller Inventory # 297261
Quantity: 1 available
Stock Image
Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)
Seller: Mooney's bookstore, Den Helder, Netherlands
Seller rating 4 out of 5 stars
Condition: Very good. Seller Inventory # 9780262024051-2-2
Quantity: 1 available
Stock Image
Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0262024055
Quantity: 1 available
Stock Image
Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0262024055
Quantity: 1 available