Analytic methods in the analysis and design of number-theoretic algorithms

@inproceedings{Bach1985AnalyticMI,
  title={Analytic methods in the analysis and design of number-theoretic algorithms},
  author={E. Bach},
  year={1985}
}
This book makes a substantial contribution to the understanding of a murky area of number theory that is important to computer science, an area relevant to the design and analysis of number-theoretic algorithms and to the construction of cryptographic protocols.Contents: Introduction; 1: Explicit Bounds for Primality Testing; Ankeny's Theorem and its Algorithmic Consequences; Background from Analytic Number Theory; Roots; Asymptotic Theorems; Zeta-function Estimates; Numerical Theorems… Expand
Algorithms in Number Theory
  • A. K. Lenstra, H. Lenstra
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
Realistic Analysis of Some Randomized Algorithms
  • E. Bach
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1991
Logarithmic Combinatorial Structures: A Probabilistic Approach
On the effectiveness of a generalization of Miller's primality theorem
A Contribution to Metric Diophantine Approximation: the Lebesgue and Hausdorff Theories
Open problems in number theoretic complexity, II
...
1
2
3
4
5
...