Improved lower bounds for the cycle detection problem

DOI10.1016/0304-3975(85)90044-1zbMath0565.68042OpenAlexW2022952433WikidataQ56388141 ScholiaQ56388141MaRDI QIDQ1058851

Eric W. Allender, Maria M. Klawe

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90044-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Exact numerical studies of Hamiltonian maps: Iterating without roundoff error

Cites Work

• Lower bounds for the cycle detection problem
• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions
• Unnamed Item