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
Chicago Style (17th ed.) CitationFournier, Hervé, and Guillaume Malod. "Universal Relations and #P-Completeness." Theoretical Computer Science 407 (2006): 97-109. https://doi.org/10.1016/j.tcs.2008.05.003.
MLA (9th ed.) CitationFournier, Hervé, and 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.
Warning: These citations may not always be 100% accurate.