1. Generating hard instances of lattice problems;Ajtai,1996
2. Settling the complexity of two-player nash equilibrium;Chen,2006
3. The complexity of computing a nash equilibrium;Daskalakis;SIAM J. Comput.,2009
4. Number balancing is as hard as Minkowski's theorem and shortest vector;Hoberg,2017