YoVDO

Berkeley in the 80s - Richard Karp and the Theory of Computing

Offered By: Simons Institute via YouTube

Tags

Theoretical Computer Science Courses Graph Theory Courses Algorithms Courses Computational Complexity Courses NP-completeness Courses Combinatorial Optimization Courses

Course Description

Overview

Watch an engaging video interview with Richard M. Karp, the 1985 ACM A.M. Turing Laureate, as part of the "Berkeley in the 80s" series. Delve into Karp's groundbreaking research on the theory of computing conducted at Berkeley, hosted by Russell Impagliazzo. This final episode of the five-part series offers valuable insights into the contributions of Turing Laureates to computer science. Explore the intellectual landscape of Berkeley in the 1980s and gain a deeper understanding of the foundations of computational theory through this in-depth conversation with one of the field's most influential figures.

Syllabus

Berkeley in the 80s, Episode 5: Richard Karp


Taught by

Simons Institute

Related Courses

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera
Intro to Theoretical Computer Science
Udacity
算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera
Algorithm Design and Analysis
University of Pennsylvania via edX