Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998

1998

Citations in the corpus

• Jammed hard-particle packings: From Kepler to Bernal and beyond (2010, background): “Indeed, the problem if finding the shortest lattice vector in a particular lattice packing (densest lattice packing) grows super-exponentially with d and is in the class of NP-hard (non-deterministic polynomial-time hard)problems (Ajtai, 1998).”