The Complexity of Finding Cycles in Periodic Functions
- 1 May 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (2) , 376-390
- https://doi.org/10.1137/0211030
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- The complexity of finding periodsPublished by Association for Computing Machinery (ACM) ,1979
- Class number, a theory of factorization, and generaPublished by American Mathematical Society (AMS) ,1971