Exploring Noc21 Cs49 Lec03
Let's dive into the details surrounding Noc21 Cs49 Lec03.
- Showed C(EQ)≥n using the fooling set method.
- Discussed particulars of the course such as time, venue, grading policy, prerequisites, etc.. Philosophical foundations of ...
- Completed proof of Immerman-Szelepscenyi Theorem. The Polynomial Hierarchy - motivation for studying, definition.
- Code and Slides: https://github.com/cuda-mode/lectures/tree/main/lecture_017.
In-Depth Information on Noc21 Cs49 Lec03
Completed NP-hardness proof of SAT. SAT polynomial time reduces to 3SAT. Why stop at 3? Properties of logspace reductions such as transitivity, closure of L under such reductions. Path is NL-complete. Proved that directed Hamiltonian path problem is NP-complete. The class coNP. Complete problem (SAT). Discussed why ... the proof by Razborov and Smolensky.
That wraps up our extensive overview of Noc21 Cs49 Lec03.