Petrosyan, Garik. “Polynomial Bounded Proof Complexities for Some Classes of DNF-Tautologies”. Mathematical Problems of Computer Science 53 (July 10, 2020): 7–13. Accessed May 30, 2025. http://www.mpcs.sci.am/index.php/mpcs/article/view/10.