Sign inSign in

Search problem

A computational problem where there can be multiple correct answers or no answer at all.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
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

3

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

    A formalization of a problem consisting of a state space, a successor function, a start state, and a goal test.
    • 17:55Uninformed Search
    • 8:22A* Search and Heuristics
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A problem with a string input and a string output where there may be zero, one, or multiple correct answers.
  • Erik Demaine

    MIT · Graduate

    The problem of maintaining a set of objects subject to insert, delete, and query operations.
    • 11:06Retroactive Data Structures

Lectures that assume it

8

Connections

21

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

3 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.