Electronic colloquium on computational complexity

Generating Hard Instances of Lattice Problems

Miklós Ajtai · 1996 · 578 citations

Natural Sciences, Computer Science, Mathematics +12

The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.

Miklós Ajtai · 1997 · 248 citations

Computing, Computer Science, Mathematics +11

Settling the Complexity of 2-Player Nash-Equilibrium

Xi Chen, Xiaotie Deng · 2005 · 195 citations

Social Sciences, Decision Sciences, Algorithms +10

Clique is hard to approximate within n 1-epsilon

Johan Håstad · 1997 · 147 citations

Computing, Computer Science, Algorithms +6

The median problems for breakpoints are NP-complete

Itsik Pe’er, Ron Shamir · 1998 · 125 citations

Natural Sciences, Computer Science, Mathematics +8