Komarath, B., Pandey, A., & Rahul, C. S. (2023). Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica, 85(9), 2554-2579. https://doi.org/10.1007/s00453-023-01108-0
Citace podle Chicago (17th ed.)Komarath, Balagopal, Anurag Pandey, a C. S. Rahul. "Monotone Arithmetic Complexity of Graph Homomorphism Polynomials." Algorithmica 85, no. 9 (2023): 2554-2579. https://doi.org/10.1007/s00453-023-01108-0.
Citace podle MLA (9th ed.)Komarath, Balagopal, et al. "Monotone Arithmetic Complexity of Graph Homomorphism Polynomials." Algorithmica, vol. 85, no. 9, 2023, pp. 2554-2579, https://doi.org/10.1007/s00453-023-01108-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..