Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
19cs422 [2019-04-07] – [Synopsis/Syllabus:] Ivan Koswara | 19cs422 [2019-06-03] – Martin Ziegler | ||
---|---|---|---|
Line 29: | Line 29: | ||
* Un-/ | * Un-/ | ||
* Reduction, degrees of undecidabiliy | * Reduction, degrees of undecidabiliy | ||
- | * (Busy Beaver function) | + | * Busy Beaver/Rado function |
* LOOP programs | * LOOP programs | ||
* and their capabilities ({{: | * and their capabilities ({{: | ||
Line 41: | Line 41: | ||
* Recursion Theorem, Fixedpoint Theorem, QUINES | * Recursion Theorem, Fixedpoint Theorem, QUINES | ||
* Oracle WHILE Programs, Post/ | * Oracle WHILE Programs, Post/ | ||
+ | * Arithmetic Hierarchy | ||
* (Post' | * (Post' | ||
- | IV. Computational Complexity | + | IV. Computational Complexity |
* Model of computation with (bit) cost: WHILE+ | * Model of computation with (bit) cost: WHILE+ | ||
* Complexity classes P, NP, PSPACE, EXP | * Complexity classes P, NP, PSPACE, EXP | ||
* and their inclusion relations | * and their inclusion relations | ||
* nondeterministic WHILE+ programs | * nondeterministic WHILE+ programs | ||
- | * Example problems: Euler Circuit, Edge Cover, | + | * Example problems: Euler Circuit, Edge Cover |
* Example problems: Hamiltonian Circuit, Vertex Cover, Independent Set, Clique, Boolean Satisfiability, | * Example problems: Hamiltonian Circuit, Vertex Cover, Independent Set, Clique, Boolean Satisfiability, | ||
+ | * Boolean formulas ({{ : | ||
- | V. Structural Complexity / NPc | + | V. Structural Complexity / NPc ({{19cs422e.ppt|ppt}}, |
* polynomial-time reductions | * polynomial-time reductions | ||
* equivalent problems Clique, Independent Set, Boolean Satisfiability, | * equivalent problems Clique, Independent Set, Boolean Satisfiability, | ||
Line 57: | Line 59: | ||
* Ladner' | * Ladner' | ||
- | VI. PSPACE and Polynomial Hierarchy | + | VI. PSPACE and Polynomial Hierarchy |
* PSPACE-completeness | * PSPACE-completeness | ||
* QBF, 3QBF, GRAPH | * QBF, 3QBF, GRAPH | ||
Line 85: | Line 87: | ||
- {{ : | - {{ : | ||
- {{ : | - {{ : | ||
+ | - {{ : | ||
+ | - {{ : | ||
+ | - {{ : | ||
+ | - {{ : | ||
===== Academic Honesty ===== | ===== Academic Honesty ===== | ||
Copied solutions receive 0 points and personal interrogation during office/ | Copied solutions receive 0 points and personal interrogation during office/ |