Petrosyan, Garik. “Polynomial Bounded Proof Complexities for Some Classes of DNF-Tautologies”. Mathematical Problems of Computer Science 53 (July 10, 2020): 7–13. Accessed November 16, 2024. http://93.187.165.2/index.php/mpcs/article/view/10.