CIAC
1994
Springer
14 years 2 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
CIAC
1994
Springer
14 years 2 months ago
1994
Springer
COLT
1993
Springer
14 years 2 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
COCO
1993
Springer
14 years 2 months ago
1993
Springer
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
COCO
1993
Springer
14 years 2 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
COCO
1993
Springer
14 years 2 months ago
1993
Springer
ANTS
1994
Springer
14 years 2 months ago
1994
Springer
ANTS
1994
Springer
14 years 2 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
ANTS
1994
Springer
14 years 2 months ago
1994
Springer
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
ANTS
1994
Springer
14 years 2 months ago
1994
Springer
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...