FSTTCS
1991
Springer
13 years 8 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
STOC
1989
ACM
13 years 8 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.