1998 · 403 citations · 13 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsOptimizationApproximation AlgorithmsComputational ComplexityRandomized AlgorithmsRandomized ComplexityRandomized ComputationShortest Path AlgorithmsNp-completenessRandomized ReductionsShortest Vector Problem
13
Generating hard instances of lattice problems (extended abstract)
Miklós Ajtai · 1996 · 1.3K citations · Full text
On the density of families of sets
N. Sauer · Journal of Combinatorial Theory Series A · 1972 · 866 citations