PETROSYAN, G. Polynomial Bounded Proof Complexities for Some Classes of DNF-Tautologies. Mathematical Problems of Computer Science, [S. l.], v. 53, p. 7–13, 2020. DOI: 10.51408/1963-0047. Disponível em: http://mpcs.sci.am/index.php/mpcs/article/view/10. Acesso em: 6 may. 2024.