697 search results - page 5 / 140 » On the Theory of Average Case Complexity |
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
CORR
2010
Springer
13 years 7 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...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...