Hardness and Approximation of High-Dimensional Search Problems (Invited Talk).

Rasmus Pagh

Browse the full MFCS paper archive.