53 search results - page 3 / 11 » Average-Case Complexity of Shellsort |
COLT
2000
Springer
14 years 3 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
RANDOM
1997
Springer
14 years 3 months ago
1997
Springer
CSL
1990
Springer
14 years 2 months ago
1990
Springer
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
ISAAC
1995
Springer
14 years 2 months ago
1995
Springer
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
CC
2007
Springer
13 years 11 months ago
2007
Springer