Date:
2nd semester , Thursday 21:15
| Lecture 1: Optimal inapproximability results for some NP-hard optimization | 15/04/1999 | Professor Johan Hastad , The Royal Institute of Technology, Stockholm, Sweden |
| Lecture 2: The hardness of approximating Maximum Set of Consistent Linear Equations | 19/04/1999 | Prof. Johan Hastad, The Royal Institute of Technology, Stockholm, Sweden |
| Lecture 3: The hardness of approximating Maximum Clique | 22/04/1999 | Prof. Johan Hastad, The Royal Institute of Technology, Stockholm, Sweden |