Complexity questions in number theory

This publication has 21 references indexed in Scilit:

• A generalization of the algorithm for continued fractions related to the algorithm of Viggo Brunn
  Journal of Mathematical Sciences, 1981
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
  SIAM Journal on Computing, 1979
• Explicit representations of dirichlet approximations
  Mathematische Annalen, 1977
• An effective number geometric method of computing the fundamental units of an algebraic number field
  Mathematics of Computation, 1977
• Riemann's hypothesis and tests for primality
  Journal of Computer and System Sciences, 1976
• Algorithm and bound for the greatest common divisor of n integers
  Communications of the ACM, 1970
• Calculating the General Solution of a Linear Diophantine Equation
  The American Mathematical Monthly, 1967
• A New Version of the Euclidean Algorith
  The American Mathematical Monthly, 1963
• Bounds for the least solutions of homogeneous quadratic equations
  Mathematical Proceedings of the Cambridge Philosophical Society, 1955
• The Least Quadratic Non Residue
  Annals of Mathematics, 1952