3 search results - page 1 / 1 » On Syntactic versus Computational Views of Approximability |
FOCS
1994
IEEE
13 years 9 months ago
1994
IEEE
COCO
2001
Springer
13 years 10 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
FUIN
2010
13 years 4 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...