 |
|
You are here: Foswiki>ABI Web>LectureWiki>DiscretMathWS10>ComputabilityComplexity (14 Feb 2011, AlexanderBockmayr)Edit Attach
Date |
Lecture | Lecture Material | Additional Material |
|---|---|---|---|
| 10.2.2011 | P and NP | Complexity.pdf | |
| 15.2.2011 | P and NP (contd) | ||
| 3.2.2011 | Turing machines | Comput1.pdf | AdditionalMaterial |
| 8.2.2011 | Undecidable problems | Comput2.pdf | AdditionalMaterial |
Exercises
| Content | Exercise | Material | Deadline |
|---|---|---|---|
| Problem sheet | exercise 13 | Exercises 13 | 11.02.11 |
Edit | Attach | Print version | History: r8 < r7 < r6 < r5 | Backlinks | View wiki text | Edit wiki text | More topic actions
Topic revision: r7 - 14 Feb 2011, AlexanderBockmayr
- This page was cached on 06 Mar 2025 - 13:21.
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