Proofs, Circuits, Communication, and Lower Bounds in Complexity Theory - Robert Robere
Offered By: Institute for Advanced Study via YouTube
Course Description
Overview
Explore the intricate world of complexity theory in this comprehensive computer science seminar. Delve into proofs, circuits, communication, and lower bounds as presented by Robert Robere, a member of the School of Mathematics at the Institute for Advanced Study. Begin with an introduction and recap before diving into semantic proof systems and resolution proof systems. Examine resolution proofs in detail, followed by discussions on translation and coding properties. Investigate the limits of these concepts and conclude with an exploration of dream proofs. This nearly two-hour lecture offers a deep dive into advanced topics in discrete mathematics and theoretical computer science.
Syllabus
Intro
Recap
L Semantic Proof System
Resolution Proof System
Resolution Proof
Translation
Coding Property
Limit
Dream Proof
Taught by
Institute for Advanced Study
Related Courses
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam Discrete Mathematics
Shanghai Jiao Tong University via Coursera