I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
2010, VOLUME 16, NUMBER 6, PAGES 109-122
A. Yu. Nesterenko
View as HTML View as gif image
The paper considers several cycle detection algorithms. Proofs of their correctness are given, bounds for complexity are obtained, some number theory applications like the factorization of integers and the discrete log problem are examined.
|Main page||Contents of the journal||News||Search|
Last modified: July 5, 2011