MATH-504 / 5 credits

Teacher: Eisenbrand Friedrich

Language: English


Summary

The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer science and cryptography during the past 30 years.

Content

Learning Prerequisites

Recommended courses

  • Linear algebra 1+2
  • Introduction to Algorithms or Discrete Optimization

Assessment methods

Oral Exam

Resources

Bibliography

  1. Thomas Rothvoss, Integer Optimization and Lattices
  2. Oded Regev, Lattices in Compter Science, Lecture Notes

In the programs

  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Integer optimisation
  • Lecture: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Integer optimisation
  • Lecture: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Integer optimisation
  • Lecture: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22