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
Chicago Style (17th ed.) CitationPart, Fedor, and 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.
MLA (9th ed.) CitationPart, Fedor, and 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.
Warning: These citations may not always be 100% accurate.