ConceptTheory & Algos
Satisfiability and graph distance
A formula phi is satisfiable if and only if there exists alpha and beta at distance three, which means the diameter of the graph is three.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.