Sciweavers

3 search results - page 1 / 1
» On Syntactic versus Computational Views of Approximability
Sort
View
80
Voted
FOCS
1994
IEEE
15 years 1 months ago
On Syntactic versus Computational Views of Approximability
Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 2 months ago
Quantum versus Classical Learnability
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...
Rocco A. Servedio, Steven J. Gortler
FUIN
2010
112views more  FUIN 2010»
14 years 8 months ago
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
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...
Luca Pulina, Armando Tacchella