Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, August 09, 2011, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Chandan Dubey

Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle

We give a polynomial time Turing reduction from the $\gamma^2\sqrt{n}$-approximate closest vector problem on a lattice of dimension $n$ to a $\gamma$-approximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved $\gamma^2n^{3/2}$. Joint work with Thomas Holenstein (published in APPROX-2011).


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login