Sign inSign in

coNP-complete

A problem is coNP-complete if it is in coNP and every other coNP problem is polynomial-time reducible to it.
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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A language L is coNP-complete if L is in coNP and every language in coNP reduces to L in polynomial time.
    • 34:39The Complexity Class coNP

Connections

4

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

Concepts2

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.