Algorithmic Number Theory: Efficient algorithms, Volume 1

MIT Press, 1996 - 512 pages
0 Avis
Les avis ne sont pas validés, mais Google recherche et supprime les faux contenus lorsqu'ils sont identifiés

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.


Avis des internautes - Rédiger un commentaire

Aucun commentaire n'a été trouvé aux emplacements habituels.

Table des matières

Intractable Problems will cover the following topics
Fundamentals of Number Theory
A Survey of Complexity Theory
The Greatest Common Divisor
Computing in Zn
Finite Fields
Solving Equations over Finite Fields
Discrete Logarithms
Open Problems
Facts and Heuristics
Basic Algorithms
A Solutions to Exercises
Droits d'auteur

Autres éditions - Tout afficher

Expressions et termes fréquents

Fréquemment cités

Page 394 - Rosier, Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor.
Page 468 - On the normal density of primes in small intervals, and the difference between consecutive primes. Arch.

Informations bibliographiques