Lower bounds for the cycle detection problem
- 30 June 1983
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 26 (3) , 392-409
- https://doi.org/10.1016/0022-0000(83)90007-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Complexity of Finding Cycles in Periodic FunctionsSIAM Journal on Computing, 1982
- Lower bounds for the cycle detection problemPublished by Association for Computing Machinery (ACM) ,1981
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- The complexity of finding periodsPublished by Association for Computing Machinery (ACM) ,1979
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975