2012/02/13 |
final exam |
Λ3. |
Algorithms and complexity I |
2012/03/07 |
final exam |
Λ2. |
Computability |
2012/03/19 |
final exam |
Λ4. |
Algorithms and complexity II |
2012/06/25 |
final exam |
Π03Β. |
Semantics of programming languages |
2012/06/27 |
final exam |
Π02Δ. |
Computational geometry |
2012/07/01 |
final exam |
Π17. |
Mathematics and cryptography |
2012/07/02 |
final exam |
Λ1. |
Mathematical logic |
2012/07/02 |
final exam |
Π05Β. |
Computation models and complexity |
2012/07/02 |
final exam |
Π11Β. |
Network algorithms: distributed, probabilistic, approximation |
2012/07/04 |
final exam |
Π03Ζ. |
Algorithms in structural bioinformatics |
2012/07/05 |
final exam |
Λ14. |
Introduction to λ-calculus |
2012/07/12 |
final exam |
Μ6. |
Set theory |
2012/07/19 |
final exam |
Π03Α. |
Structural complexity |
2012/09/04 |
september exam |
Μ6. |
Set theory |
2012/09/14 |
september exam |
Λ3. |
Algorithms and complexity I |
2012/09/24 |
september exam |
Λ4. |
Algorithms and complexity II |
2012/09/26 |
september exam |
Λ1. |
Mathematical logic |
2012/10/05 |
september exam |
Λ2. |
Computability |
2012/10/05 |
september exam |
Λ2. |
Computability |
|
final exam |
Λ14. |
Introduction to λ-calculus |
|
final exam |
ΜΝ11β. |
Nonmonotonic Logic |
|
final exam |
ΜΠ11. |
Modal logic |
|
september exam |
Λ3. |
Algorithms and complexity I |
|
final exam |
ΜΞ11. |
Non-approximability of NP-hard problems |