Sign inSign in

Fine-grained complexity

The study of exact running times and fine-grained differences within polynomial time complexity rather than just polynomial vs exponential.
as Barna Saha defines itUC BerkeleyThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Polynomial time3Reduction2Complexity classes P1P and NP1Polynomial time reduction1Traditional complexity theory1

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A field of study concerning the exact polynomial time complexity of problems solvable in polynomial time.
    • 16:13Exponential Time Hypotheses: ETH and SETH
    • 30:21Hardness within P

Connections

6

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures3

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.