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-29] – [Synopsis/Syllabus:] Martin Ziegler | 19cs422 [2019-06-03] – Martin Ziegler | ||
---|---|---|---|
Line 49: | Line 49: | ||
* 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 58: | 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 86: | 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/ |