Part, F., & Tzameret, I. (2021). Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. Computational complexity, 30(1), . https://doi.org/10.1007/s00037-020-00202-x
Citace podle Chicago (17th ed.)Part, Fedor, a Iddo Tzameret. "Resolution with Counting: Dag-Like Lower Bounds and Different Moduli." Computational Complexity 30, no. 1 (2021). https://doi.org/10.1007/s00037-020-00202-x.
Citace podle MLA (9th ed.)Part, Fedor, a Iddo Tzameret. "Resolution with Counting: Dag-Like Lower Bounds and Different Moduli." Computational Complexity, vol. 30, no. 1, 2021, https://doi.org/10.1007/s00037-020-00202-x.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..