Brent's algorithm ( Cycle Detection)
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O((\lambda + \mu)$ t_f) == Space Complexity == $O({1})$ Pointer algo (Algorithmic Cryptanalysis) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference == https://maths-people.anu.edu.au/~brent/pd/rpb005.pdf")
Time Complexity
$O((\lambda + \mu)$ t_f)
Space Complexity
$O({1})$ Pointer algo
(Algorithmic Cryptanalysis)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1973