Encyclopedia > Q > Quantified boolean formula problem
Quantified boolean formula problem
In computational complexity theory, the quantified boolean formula problem (QBF) is a generalization of the boolean satisfiability problem in which both existential quantifiers and universal quantifiers can be applied to each variable. Put another way, it asks whether a first-order logic sentential form over a set of boolean variables is true or false.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)