2412 search results - page 29 / 483 » Which Problems Have Strongly Exponential Complexity |
COCO
2009
Springer
14 years 4 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
STRINGOLOGY
2008
13 years 11 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
ADAEUROPE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...