Can every randomized algorithm be derandomized?


Among the most important modern algorithmic techniques is the use of random decisions. Starting in the 1970's, many of the most significant results were randomized algorithms solving basic compuatational problems that had (to that time) resisted efficient deterministic computation. (Ber72, SS79, Rab80, Sch80, Zip79, AKLLR). In contrast, many of the most… (More)
DOI: 10.1145/1132516.1132571


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics