Cheng, Q. (2004). On the ultimate complexity of factorials. Theoretical computer science, 326(1), 419-429. https://doi.org/10.1016/j.tcs.2004.06.020
Citace podle Chicago (17th ed.)Cheng, Qi. "On the Ultimate Complexity of Factorials." Theoretical Computer Science 326, no. 1 (2004): 419-429. https://doi.org/10.1016/j.tcs.2004.06.020.
Citace podle MLA (9th ed.)Cheng, Qi. "On the Ultimate Complexity of Factorials." Theoretical Computer Science, vol. 326, no. 1, 2004, pp. 419-429, https://doi.org/10.1016/j.tcs.2004.06.020.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..