Prime numbers : a computational perspective
Author(s)
Bibliographic Information
Prime numbers : a computational perspective
Springer, c2005
2nd ed
- : softcover
Available at 37 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"Softcover reprint of the hardcover 2nd edition 2005"--T. p. verso of softcover
Includes bibliographical references (p. [547]-575) and index
Description and Table of Contents
Description
Bridges the gap between theoretical and computational aspects of prime numbers
Exercise sections are a goldmine of interesting examples, pointers to the literature and potential research projects
Authors are well-known and highly-regarded in the field
Table of Contents
Preface.- Primes!.- Number-Theoretical Tools.- Recognizing Primes and Composites.-Primality Proving.- Exponential Factoring Algorithms.- Subexponential Factoring Algorithms.- Elliptic Curve Arithmetic.- The Ubiquity of Prime Numbers.- Fast Algorithms for Large-Integer Arithmetic.- Book Pseudocode.- References.- Index.
by "Nielsen BookData"