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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, June 20, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Chandan Dubey

A Lattice is a discrete subgroup of R^n. Given a list of linearly independent vectors b_1, ..., b_n called the basis -- the lattice spanned by these vectors is the set of all integer linear combinations. After the worst case to average case reduction of the shortest vector problem given by Ajtai, Lattices have seen increasing applications in cryptographic constructions. One important problem in this area is the unique shortest vector problem. In this talk, I aim to show the search to decision reduction of approximate unique shortest vector problem. On the way, we will see a simple proof of Minkowski’s convex body theorem. Joint work with Divesh Aggarwal.

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

Previous talks by year: 2019 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