Applied Discrete Mathematics: Lattices in Computer Science
CSC 2414

Fall 2011
CSC 2414 Lattices in Computer Science
September 27, 2011
Lecture 4
Lecturer: Vinod Vaikuntanathan
Scribe: Wesley George
Topics covered this lecture:
SV P CV P
Approximating CVP: Babais Nearest Plane Algorithm
An Ecient Algorithm for Integer Programming
Applied Discrete Mathematics: Lattices in Computer Science
CSC 2414

Fall 2011
CSC 2414 Lattices in Computer Science
September 20, 2011
Lecture 2
Lecturer: Vinod Vaikuntanathan
1
Scribe: Sergey Gorbunov
Lecture Outline
Alternative Denition of Lattices
Upper bound on the length of a shortest lattice vector (1 (L)
Successive Minima
Applied Discrete Mathematics: Lattices in Computer Science
CSC 2414

Fall 2011
CSC 2414 Lattices in Computer Science
Instructor: Vinod Vaikuntanathan
Problem Set 1
Handed Out: September 13, 2011
Due: October 3, 2011
Notes
This problem set is worth 100 points.
Collaboration is allowed, but you must write up the solutions by yoursel
Applied Discrete Mathematics: Lattices in Computer Science
CSC 2414

Fall 2011
CSC 2414 Problem Set 3
Due: December 22, 2011
Notes
This problem set is worth 100 points.
Collaboration is allowed, but you must write up the solutions by yourself without consulting to notes
from the discussions. You must also reference your sources.
Applied Discrete Mathematics: Lattices in Computer Science
CSC 2414

Fall 2011
CSC 2414 Lattices in Computer Science
October 11, 2011
Lecture 5
Lecturer: Vinod Vaikuntanathan
Scribe: Joel Oren
In the last class, we studied methods for (approximately) solving the following two problems:
The approximate shortest vector problem, denot
Applied Discrete Mathematics: Lattices in Computer Science
CSC 2414

Fall 2011
CSC 2414 Problem Set 2
Due: October 31, 2011
Notes
This problem set is worth 100 points.
Collaboration is allowed, but you must write up the solutions by yourself without consulting to notes
from the discussions. You must also reference your sources.
G