 |
|
You are here: Foswiki>ABI Web>LectureWiki>DiscretMathWS11>ComputabilityComplexityWS11 (13 Feb 2012, AlexanderBockmayr)Edit Attach
Computability and Complexity Theory
Lectures
| Date | Lecture | Lecture Material | Additional Material | |||
|---|---|---|---|---|---|---|
| 02.02.2012 | Turing machines | Comput1.pdf | ||||
| 07.02.2012 | Undecidable problems | Comput2.pdf | AdditionalMaterial | |||
| 09.02.2012 | P and NP | Complexity.pdf | ||||
| 14.02.2012 | P and NP (ctd) | Complexity2.pdf | ||||
Exercises
| Content | Exercise | Material | Deadline |
|---|---|---|---|
| Problem sheet | exercise 13 | Exercises 13 | 10.2.12 |
Edit | Attach | Print version | History: r8 < r7 < r6 < r5 | Backlinks | View wiki text | Edit wiki text | More topic actions
Topic revision: r7 - 13 Feb 2012, AlexanderBockmayr
- This page was cached on 01 Feb 2025 - 18:28.
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors. Ideas, requests, problems regarding Foswiki? Send feedback