3 citations · 5 across the 6 of their papers we have counts for
1 paper · 2 filters
Grigoriy V. Bokov
In this paper, we consider the complexity of propositional proofs of classical and intuitionistic tautologies. In fact, we describe a nondeterministic polynomial-time decision proc…