Sign inSign in

Succinct SAT

A satisfiability problem where the input formula is represented succinctly by a small circuit rather than explicitly written out.
as Ryan O'Donnell 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

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 27:16Quasilinear Cook–Levin Theorem

Connections

7

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

Concepts5

Lectures2

1 lecturer. 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.