Exploring Noc21 Cs49 Lec13
Exploring Noc21 Cs49 Lec13 reveals several interesting facts.
- Showed C(EQ)≥n using the fooling set method.
- Proved that directed Hamiltonian path problem is NP-complete. The class coNP. Complete problem (SAT). Discussed why ...
- Definition of Boolean circuits, families of circuits and the circuit class SIZE(T(n)). Notion of depth of a circuit. The class P/poly and ...
- Completed proof of Immerman-Szelepscenyi Theorem. The Polynomial Hierarchy - motivation for studying, definition.
- Valiant-Vazirani Theorem for USAT. Definition of the classes #P and ⊕P. #SAT is complete for #P. Closure of the ⊕ quantifier ...
In-Depth Information on Noc21 Cs49 Lec13
Proof of Σp2=NPSAT. Introduction to Boolean circuits. Set Lower Bound Protocol and Graph Non-Isomorphism is in AM. the proof by Razborov and Smolensky. Error reduction proof for BPP machines. BPP ⊆ P/poly.
BPP ⊆Σp2∩Πp2. The logspace classes BPL and RL. Undirected reachability in RL.
Stay tuned for more updates related to Noc21 Cs49 Lec13.
