Sign inSign in
ConceptSystems & CS

NP-complete problems

A class of problems for which a proposed solution can be checked quickly, but finding a solution requires exponential time.
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.

Algorithm complexity1Exponential time1Time complexity1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Brian Yu

    Harvard University · Undergraduate

    Problems for which there is no known efficient way to find an optimal solution.
    • 6:12:17Harvard CS50’s Artificial Intelligence with Python – Full University Course

Lectures that assume it

2

Connections

7

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

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.