Authors: Khanna, S Linial, N Safra, S

Citation: S. Khanna et al., On the hardness of approximating the chromatic number, COMBINATORI, 20(3), 2000, pp. 393-415

Authors: Goldreich, O Safra, S

Citation: O. Goldreich et S. Safra, A combinatorial consistency lemma with application to proving the PCP theorem, SIAM J COMP, 29(4), 2000, pp. 1132-1154

Authors: Goldreich, O Micciancio, D Safra, S Seifert, JP

Citation: O. Goldreich et al., Approximating shortest lattice vectors is not harder than approximating closest lattice vectors, INF PROCESS, 71(2), 1999, pp. 55-61