Search result: Courses in Spring Semester 2015
Computer Science Master | |||||||||||||||
Focus Courses | |||||||||||||||
Focus Courses in Theoretical Computer Science | |||||||||||||||
Focus Core Courses Theoretical Computer Science | |||||||||||||||
Number | Title | Type | ECTS | Hours | Lecturers | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
252-0407-00L | Cryptography | W | 7 credits | 3V + 2U + 1A | |||||||||||
252-0407-00 V | Cryptography | 3 hrs |
| U. Maurer | |||||||||||
252-0407-00 U | Cryptography | 2 hrs |
| U. Maurer | |||||||||||
252-0407-00 A | Cryptography Project Work, no fixed presence required. | 1 hrs | U. Maurer | ||||||||||||
252-0491-00L | Satisfiability of Boolean Formulas - Combinatorics and Algorithms | W | 7 credits | 3V + 2U + 1A | |||||||||||
252-0491-00 V | Satisfiability of Boolean Formulas - Combinatorics and Algorithms | 3 hrs |
| E. Welzl | |||||||||||
252-0491-00 U | Satisfiability of Boolean Formulas - Combinatorics and Algorithms | 2 hrs |
| E. Welzl | |||||||||||
252-0491-00 A | Satisfiability of Boolean Formulas - Combinatorics and Algorithms No presence required. | 1 hrs | E. Welzl |
- Page 1 of 1