C. Seshadhri
Publishes 2 feeds
CSE104, Fall 2020: Computational Complexity
15 posts · theirs
CSE290A, Spring 2020: Randomized Algorithms
15 posts · theirs
Lately
CSE104, Lec 16: Introduction to circuit complexity
CSE104, Lec 15: More on the polynomial hierarchy
CSE104, Lec 14: The polynomial hierarchy
CSE104, Lec 13: NL = co-NL, the Immerman-Szelepcsenyi theorem
CSE104, Lec 11: Logspace reductions and NL-completeness
CSE104, Lec 12: Read-once certificates for NL, starting NL=co-NL
CSE104, Lec 10: QBF is PSPACE-complete, the notion of logspace reductions
CSE104, Lec 9: Savitch's theorem, PSPACE = NPSPACE
CSE104, Lec 8: EXP vs NEXP and the time hierarchy theorem
CSE104, Lec 7: co-NP and the factoring problem
CSE104, Lec 5: The proof of the Cook-Levin theorem and the NP-completeness of 3SAT
CSE104: Lec 4, NP-completeness, the Cook-Levin Theorem
Everything on this page was read from markup C. Seshadhri published — a rel="me" link, an h-card, or the feed’s own author element. Nothing was inferred from anywhere else. To correct or remove it, get in touch. Machine-readable: JSON