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