1.
Petrosyan G. Polynomial Bounded Proof Complexities for Some Classes of DNF-Tautologies. MPCS [Internet]. 2020Jul.10 [cited 2024May7];53:7-13. Available from: http://mpcs.sci.am/index.php/mpcs/article/view/10