The Dawn of Computational Complexity Theory

The Dawn of Computational Complexity Theory

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=0QqQRneORgk


Duration: 55:01
1,544 views
44

Dick Karp (UC Berkeley)
https://simons.berkeley.edu/talks/dawn-computational-complexity-theory
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing



Other Videos By Simons Institute for the Theory of Computing


2021-03-19Trustworthy and Distributed Automated Reasoning
2021-03-18Belief and Survey Propagation
2021-03-17Non-CDCL Solvers
2021-03-17Panel & Questions | Quantum Colloquium
2021-03-17Towards Practical Quantum Advantage | Quantum Colloquium
2021-03-17What Maximum Clique Algorithms Can Teach Us, And Vice-Versa
2021-03-17Tutorial Session: Introduction to Quantum Chemistry | Quantum Colloquium
2021-03-15A Brief Introduction to Theoretical Foundations of Machine Learning and Machine Teaching
2021-03-12United for Change: Deliberative Coalition Formation to Change the Status Quo
2021-03-11Are we aging well?
2021-03-11The Dawn of Computational Complexity Theory
2021-03-10Quantum Fault Tolerance with Flag Qubits | Quantum Colloquium
2021-03-09Beyond NP with Tractable Circuits
2021-03-08Synthesis of Functional Reactive Programs via a Reduction of Asynchronous Inputs to Lists
2021-03-08Synthesis of Coordination Programs from Linear Temporal Specifications
2021-03-08Synthesizing Approximate Implementations for Reactive Systems
2021-03-08Control Synthesis and its Magical Futures
2021-03-08Shield Synthesis for Safe Reinforcement Learning
2021-03-08TBA
2021-03-05Designing Agents' Preferences, Beliefs, and Identities
2021-03-04On Symmetry and Quantification: A New Approach to Verify Distributed Protocols


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Dick Karp
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing