Return to Colloquia & Seminar listing
Covering Cubes and the Closest Vector Problem
Student-Run Discrete Math SeminarSpeaker: | Katrina Glaeser, UC Davis |
Location: | 2240 MSB |
Start time: | Thu, Feb 23 2012, 12:10PM |
I'll talk about what the closest vector problem is, and why it is hard. Then I will talk about the covering method in the paper "Covering Cubes and the Closest Vector Problem" by Eisenbrand, Hähnle, and Niemeier.