# Course Identification

Fine-Grained Complexity
20224191

Dr. Amir Abboud
Tomer Grossman

## Course Schedule and Location

2022
First Semester
Monday, 14:15 - 16:00, Ziskind, Rm 155
25/10/2021
18/03/2022

## Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; Regular; 2.00 points

N/A

## Prerequisites

A basic course in algorithms and in complexity theory.

50

English

## Attendance and participation

Expected and Recommended

Numerical (out of 100)

50%
50%

Take-home exam

27/02/2022
N/A
-
N/A

3

## Syllabus

Whereas traditional complexity theory classifies problems into polynomial time solvable (easy) or NP-hard, a more modern complexity theory aims to achieve a more fine-grained classification. For example, we'd like to know if the time complexity is near-linear or quadratic? This is motivated by the fact that, with the growing sizes of data, even quadratic time can be impractical.

This course will present the current approach for obtaining fine-grained complexity results: we start with a small set of conjectures (similar to P \neq NP) about the exact complexity of certain core problems and devise a host of combinatorial reductions to achieve fine-grained lower bounds for many other problems.

The course will cover:
- The main conjectured-to-be-hard problems, what we know about them algorithmically, and how to reduce them to other problems. These problems include: k-SAT, 3-SUM, All-Pairs Shortest Paths, and k-Clique.
- Various examples of fine-grained results for important problems on strings (e.g. Edit-Distance), graphs (e.g. Diameter), and geometric data (e.g. Closest Pair).
- Other topics such as hardness of approximation, parameterized complexity, and barriers for reductions.

## Learning Outcomes

1. Whereas a basic course in complexity theory provides the students with tools to prove whether a problem that they encounter is in P or not (assuming P \neq NP), this course provides them with tools to prove whether a problem is in near-linear time or probably not (assuming certain conjectures).

2. Familiarity with the most basic computational problems that are not known to be solvable in near-linear time.

3. Ability to understand state of the art research in fine-grained complexity.