Quantified boolean formula problem
Data Structures and Algorithms
2018-07-23 v2
Abstract
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 , stops in time bounded by and answers yes if is true and no otherwise.
Cite
@article{arxiv.1807.07005,
title = {Quantified boolean formula problem},
author = {Grigoriy V. Bokov},
journal= {arXiv preprint arXiv:1807.07005},
year = {2018}
}
Comments
In Russian, 5 pages, submitted to Doklady Mathematics