Exploring Noc21 Cs49 Lec39
Exploring Noc21 Cs49 Lec39 reveals several interesting facts.
- Proved that directed Hamiltonian path problem is NP-complete. The class coNP. Complete problem (SAT). Discussed why ...
- Complete problems for Σpi and Πpi. Why PH is not believed to have a complete problem?Alternating Turing Machines - definition, ...
- Error reduction proof for BPP machines. BPP ⊆ P/poly.
- Completed NP-hardness proof of SAT. SAT polynomial time reduces to 3SAT. Why stop at 3?
- Set Lower Bound Protocol and Graph Non-Isomorphism is in AM.
In-Depth Information on Noc21 Cs49 Lec39
Showed C(EQ)≥n using the fooling set method. Introduced the permanent and determinant functions. Lower bounding the communication complexity of a function using the tiling method. Completed proof of Immerman-Szelepscenyi Theorem. The Polynomial Hierarchy - motivation for studying, definition.
the proof by Razborov and Smolensky.
Stay tuned for more updates related to Noc21 Cs49 Lec39.
