Lower bounds for the cycle detection problem

DOI10.1016/0022-0000(83)90007-7zbMath0509.68040OpenAlexW2010923380MaRDI QIDQ1838298

Faith E. Fich

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90007-7

zbMATH Keywords

cycle detection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Exact numerical studies of Hamiltonian maps: Iterating without roundoff error ⋮ Improved lower bounds for the cycle detection problem

Cites Work

• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions
• A monte carlo method for factorization
• Unnamed Item

This page was built for publication: Lower bounds for the cycle detection problem