218
click to vote
COCO
15 years 11 months ago
1991 Springer 
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
195
Voted
COCO
15 years 11 months ago
1991 Springer 
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
193
click to vote
COCO
15 years 11 months ago
1991 Springer 
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
166
click to vote
COCO
15 years 11 months ago
1991 Springer 
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
|
Algorithms