@article{4929c5adcff8416e90d5698e477f45bf,
title = "Resolution with Counting: Dag-Like Lower Bounds and Different Moduli",
keywords = "03F20, 13P15, 68Q17, Linear decision trees, Lower bounds, Polynomial calculus, Proof complexity, Propositional pigeonhole principle, Resolution, Resolution over linear equations, Tseitin formulas",
author = "Fedor Part and Iddo Tzameret",
year = "2021",
month = jan,
day = "8",
doi = "10.1007/s00037-020-00202-x",
language = "English",
volume = "30",
journal = "Computational Complexity",
issn = "1016-3328",
publisher = "Springer International Publishing",
number = "1",
}