Lower bounds for the cycle detection problem

DOI10.1016/0022-0000(83)90007-7MaRDI QIDQ1838298zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A monte carlo method for factorization
• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838298)