156
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...