Kjos-Hanssen, B., Stephan, F., & Teutsch, J. (2012). Arithmetic complexity via effective names for random Sequences. ACM transactions on computational logic, 13(3), . https://doi.org/10.1145/2287718.2287724
Chicago Style (17th ed.) CitationKjos-Hanssen, Bjørn, Frank Stephan, and Jason Teutsch. "Arithmetic Complexity via Effective Names for Random Sequences." ACM Transactions on Computational Logic 13, no. 3 (2012). https://doi.org/10.1145/2287718.2287724.
MLA (9th ed.) CitationKjos-Hanssen, Bjørn, et al. "Arithmetic Complexity via Effective Names for Random Sequences." ACM Transactions on Computational Logic, vol. 13, no. 3, 2012, https://doi.org/10.1145/2287718.2287724.
Warning: These citations may not always be 100% accurate.