ConceptTheory & Algos
Max-E3-SAT
An optimization problem where clauses have exactly three literals and the goal is to satisfy the maximum fraction of clauses.
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.
NP-hardness1Satisfiability problem1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.