Recent Hardness of Approximation Results in Parameterized Complexity
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
Explore recent hardness of approximation results in parameterized complexity through this comprehensive 57-minute talk. Delve into the inapproximability of the k-clique problem, gain valuable technical insights, and discover open problems in the field. Presented by Karthik C. S. at the Hausdorff Center for Mathematics, this lecture offers a thorough survey of cutting-edge research in computational complexity theory, providing both theoretical foundations and practical implications for researchers and advanced students in computer science and mathematics.
Syllabus
Karthik C. S.: Recent Hardness of Approximation results in Parameterized Complexity
Taught by
Hausdorff Center for Mathematics
Related Courses
Approximation Algorithms Part IÉcole normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera 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 Delivery Problem
University of California, San Diego via Coursera