2661 search results - page 169 / 533 » Quantum Complexity Classes |
141
Voted
COCO
2001
Springer
15 years 8 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
118
click to vote
NIPS
2007
15 years 4 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
122
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
126
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
125
Voted
SCHOLARPEDIA
2008
15 years 1 months ago
2008
ABSTRACT. We discuss a special eigenstate of the quantized periodic CalogeroMoser system associated to a root system. This state has the property that its eigenfunctions, when rega...