$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing
$k$-Independent Gaussians Fool Polynomial Threshold Functions
$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Canada
World
United States