Computational Complexity in Theory and in Practice by Richard M. Karp
Offered By: International Centre for Theoretical Sciences via YouTube
Course Description
Overview
Explore the contrasting approaches to algorithm efficiency in theoretical computer science and practical computing in this 1-hour 17-minute distinguished lecture by Professor Emeritus Richard M. Karp. Delve into theoretical concepts such as complexity classes P and NP, NP-completeness, approximation algorithms, and hardness of approximation. Examine practical applications including satisfiability solvers, linear and integer programming, the traveling salesman problem, deep learning algorithms, and game-playing programs based on reinforcement learning. Gain insights into the metrics used for evaluating algorithms in both theoretical and practical contexts, comparing worst-case performance analysis with empirical performance evaluation.
Syllabus
Computational Complexity in Theory and in Practice by Richard M. Karp
Taught by
International Centre for Theoretical Sciences
Related Courses
Linear and Discrete OptimizationÉcole Polytechnique Fédérale de Lausanne via Coursera Operations Research (1): Models and Applications
National Taiwan University via Coursera Operations Research (2): Optimization Algorithms
National Taiwan University via Coursera Dynamic Programming, Greedy Algorithms, and Intractability
University of Colorado Boulder via Coursera Operations Research
SUNY Binghamton University via YouTube