YoVDO

Recent Hardness of Approximation Results in Parameterized Complexity

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Theoretical Computer Science Courses Approximation Algorithms Courses Parameterized Complexity Courses

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

A Parameterized Approximation Scheme for Min k-Cut
IEEE via YouTube
Parameterized Complexity of Quantum Invariants of Knots
Applied Algebraic Topology Network via YouTube
Sparse Integer Programming Is FPT
Hausdorff Center for Mathematics via YouTube
Parametrized Algorithms and Possible Future Directions
Hausdorff Center for Mathematics via YouTube
Introduction to Parameterized Algorithms and Applications
Hausdorff Center for Mathematics via YouTube