Sign inSign in
ConceptMathematics

Schaefer's theorem

A theorem stating that for Boolean domains, every constraint satisfaction problem is either in P or NP-complete.
as Marvin Kunneman defines itMax Planck Institute for Informatics
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.

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.