Sciweavers

3250 search results - page 32 / 650
» Parameterized Learning Complexity
Sort
View
EUROCOLT
1995
Springer
14 years 1 months ago
Stochastic complexity in learning
Jorma Rissanen
SIAMCOMP
2008
84views more  SIAMCOMP 2008»
13 years 9 months ago
Resolution Is Not Automatizable Unless W[P] Is Tractable
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
Michael Alekhnovich, Alexander A. Razborov
COLT
2007
Springer
14 years 4 months ago
Rademacher Margin Complexity
Liwei Wang, Jufu Feng
COLT
1998
Springer
14 years 2 months ago
The Query Complexity of Finding Local Minima in the Lattice
Amos Beimel, Felix Geller, Eyal Kushilevitz