Sign inSign in

Graph non-isomorphism

The complement of the graph isomorphism problem, determining whether two graphs are not isomorphic.
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.

Graph isomorphism2AM1Complement problems1

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 33:56Introduction to Arthur-Merlin classes, MA and AM

Connections

4

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

Concepts2

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.