ConceptTheory & Algos
Not-all-equal SAT
A satisfiability variant where each clause must have at least one true literal and at least one false literal, meaning literals are not all equal.
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.
Boolean literals and clauses1CNF-SAT1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.