Sign inSign in

Reduction from 3SAT to E3SAT

A polynomial-time algorithm that transforms any 3CNF formula into an equivalent 3CNF formula where every clause has exactly three distinct literals.
as David Witmer 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.

Lecturers

1

    Connections

    4

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

    Concepts3

    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.