Sciweavers

1 search results - page 1 / 1
» fsttcs 1991
Sort
View
103
Voted
FSTTCS
1991
Springer
15 years 29 days ago
Randomizing Reductions of Search Problems
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...
Andreas Blass, Yuri Gurevich