Citation: Ae. Andreev et al., Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs, THEOR COMP, 221(1-2), 1999, pp. 3-18
Citation: Jdp. Rolim et L. Trevisan, A case study of de-randomization methods for combinatorial approximation algorithms, J COMB OPTI, 2(3), 1998, pp. 219-236