Hardness results and spectral techniques for combinatorial problems on circulant graphs

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Computing, Computer Science, Algorithms +3

On the hardness of approximating minimization problems

Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 890 citations · Full text

Computing, Computer Science, Algorithms +5

Proof verification and hardness of approximation problems

Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations

Computing, Computer Science, Mathematics +16

Proceedings of the 30th IEEE symposium on Foundations of computer science

Zvi Galil, E. K. Blum · Foundations of Computer Science · 1994 · 651 citations

Computing, Computer Engineering, Computer Science +14

On computing the discrete Fourier transform

S. Winograd · Mathematics of Computation · 1978 · 614 citations · Full text

Computing, Computer Science, Mathematics +11