Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

Proof verification and the hardness of approximation problems

Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text

Computing, Computer Science, Mathematics +14

Probabilistic checking of proofs

Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text

Computing, Computer Science, Mathematics +14

A Parallel Repetition Theorem

Ran Raz · SIAM Journal on Computing · 1998 · 728 citations

Computing, Computer Science, Mathematics +14

Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

Ming Gu, Stanley C. Eisenstat · SIAM Journal on Scientific Computing · 1996 · 702 citations

Computing, Computer Engineering, Computer Science +13