Polynomial Time Algorithms for Finding Integer Relations among Real Numbers

This publication has 15 references indexed in Scilit:

• On the limits of computations with the floor function
  Information and Computation, 1988
• Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
  Mathematics of Computation, 1988
• Minkowski's Convex Body Theorem and Integer Programming
  Mathematics of Operations Research, 1987
• A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
  Journal of Algorithms, 1987
• Polynomial time algorithms for finding integer relations among real numbers
  Published by Springer Nature ,1986
• A short proof of the existence of vector Euclidean algorithms
  Proceedings of the American Mathematical Society, 1986
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982
• Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
  Bulletin of the American Mathematical Society, 1979
• The Jacobi-Perron Algorithm Its Theory and Application
  Lecture Notes in Mathematics, 1971
• Allgemeine Theorie der kettenbruchähnlichen Algorithmen, in welchen jede Zahl aus drei vorhergehenden gebildet wird.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1868