activity
20142018
most citedUndecidability of the problem of recognizing axiomatizations for implicative propositional calculi

3 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing 2018 · cs.DSShow all

1 paper · 2 filters

cs.DS2018

Quantified boolean formula problem

Grigoriy V. Bokov

This paper is devoted to the complexity of the quantified boolean formula problem. We describe a simple deterministic algorithm that, for a given quantified boolean formula , st…