Algorithmic Number Theory: Efficient algorithms, Volumen 1MIT Press, 1996 - 512 páginas 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 provided in the text or left as an exercise has a reference in the notes section that appears at the end of each chapter. The bibliography contains over 1750 citations to the literature. Finally, it blends computational theory with practice by covering some of the practical aspects of algorithm implementations. |
Índice
1 | 3 |
4 | 19 |
5 | 27 |
9 | 34 |
1 | 41 |
9 | 59 |
Computing in Zn | 101 |
Finite Fields | 125 |
Solving Equations over Finite Fields | 155 |
Discrete Logarithms | 162 |
Open Problems | 194 |
Facts and Heuristics | 203 |
A Solutions to Exercises | 319 |
1 | 354 |
3 | 417 |
Otras ediciones - Ver todo
Algorithmic Number Theory: Efficient Algorithms Eric Bach,Jeffrey Shallit No hay ninguna vista previa disponible - 1996 |
Algorithmic Number Theory: Efficient algorithms, Volumen 1 Eric Bach,Jeffrey Outlaw Shallit No hay ninguna vista previa disponible - 1996 |
Algorithmic Number Theory: Efficient Algorithms, Volumen 1 Eric Bach,Jeffrey Shallit No hay ninguna vista previa disponible - 1996 |
Términos y frases comunes
a₁ algebraic number arithmetic Assume ERH asymptotic Berlekamp binary bit operations bound Carmichael numbers Chapter Chinese remainder theorem coefficients compute congruences conjecture continued fraction COROLLARY cyclic D. H. Lehmer defined denote the number deterministic polynomial discussed element equation Erdős estimate Euclidean algorithm Euler example Exercise Fermat finite fields formula Fq[X gcd(a given H. W. Lenstra Hence input irreducible polynomial Lemma li(x linear log log Math method mod f mod q modulo monic polynomial multiplication nonzero number field number of primes number theory O(lg polynomial of degree polynomial-time polynomials in k[X Pomerance positive integers primality testing prime factorization prime number theorem primitive root probabilistic problem proof pseudoprime quadratic nonresidue randomized algorithm relatively prime result Riemann hypothesis ring root of unity running Show sieve solution square roots squarefree steps subgroup Suppose u₁ zeroes zeta function
Pasajes populares
Página 394 - Rosier, Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor.