Introduction to Noc21 Cs49 Lec05
Exploring Noc21 Cs49 Lec05 reveals several interesting facts. Padding technique to show that collapses in lower order classes translate to collapses in higher classes. Time hierarchy theorem ...
Noc21 Cs49 Lec05 Comprehensive Overview
Proved that directed Hamiltonian path problem is NP-complete. The class coNP. Complete problem (SAT). Discussed why ... Proof of Σp2=NPSAT. Introduction to Boolean circuits. Completed proof of Immerman-Szelepscenyi Theorem. The Polynomial Hierarchy - motivation for studying, definition.
Completed NP-hardness proof of SAT. SAT polynomial time reduces to 3SAT. Why stop at 3?
Summary & Highlights for Noc21 Cs49 Lec05
- Introduction to space complexity. Machine model (work tape is counted towards space used only). Deterministic and non ...
- Showed C(EQ)≥n using the fooling set method.
- BPP ⊆Σp2∩Πp2. The logspace classes BPL and RL. Undirected reachability in RL.
- Error reduction proof for BPP machines. BPP ⊆ P/poly.
- the proof by Razborov and Smolensky.
Stay tuned for more updates related to Noc21 Cs49 Lec05.
