Sign inSign in

Worst-case hardness

The assumption that a problem like 3-SAT does not have a small circuit that gets it correct on every input.
as Venkatesan Guruswami defines itCarnegie Mellon University
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    Statements like P does not equal NP where no algorithm gets the right answer on every instance.
    • 41:18Beyond Worst-Case Analysis

Connections

7

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

Concepts5

Lectures2

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.