3 citations · 5 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…
cs.CC2018
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
This paper is devoted to the complexity of the Boolean satisfiability problem. We consider a version of this problem, where the Boolean formula is specified in the conjunctive norm…