Citation: Aef. Clementi et L. Trevisan, Improved non-approximability results for minimum vertex cover with densityconstraints, THEOR COMP, 225(1-2), 1999, pp. 113-128
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