Fournier, H., & Malod, G. (2006). Universal Relations and #P-Completeness. Theoretical Computer Science, 407, 97-109. https://doi.org/10.1016/j.tcs.2008.05.003
Citace podle Chicago (17th ed.)Fournier, Hervé, a Guillaume Malod. "Universal Relations and #P-Completeness." Theoretical Computer Science 407 (2006): 97-109. https://doi.org/10.1016/j.tcs.2008.05.003.
Citace podle MLA (9th ed.)Fournier, Hervé, a Guillaume Malod. "Universal Relations and #P-Completeness." Theoretical Computer Science, vol. 407, 2006, pp. 97-109, https://doi.org/10.1016/j.tcs.2008.05.003.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..