"COMPUTERS Hardware Mainframes & Minicomputers." . . "complexité de calcul (informatique) nombres aléatoires." . . "Complexitat computacional" . . . . . . . . . . "Pairwise independence and derandomization" . "Pairwise independence and derandomization"@en . . . . . . . . . . . . . . . . "Llibres electrònics" . . . . . . . . . "This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a small sample space, appropriately chosen. In some cases this can be proven directly (giving \"unconditional derandomization\"), and in others it uses computational assumptions, like the existence of 1-way functions (giving \"conditional derandomization\")."@en . "Electronic books"@en . . "Informàtica Mètodes estadístics." . . . . "Computer science." . . "Informàtica Matemàtica." . .