Petrosyan, G. “Polynomial Bounded Proof Complexities for Some Classes of DNF-Tautologies”. Mathematical Problems of Computer Science, vol. 53, July 2020, pp. 7-13, doi:10.51408/1963-0047.