9842 search results - page 347 / 1969 » Problem complexity |
185
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
156
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
180
click to vote
AAAI
2006
15 years 8 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
181
click to vote
STACS
1993
Springer
15 years 11 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
220
click to vote
WINE
2005
Springer
16 years 9 days ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...