ConceptTheory & Algos
Satisfiability (SAT) decider
A non-deterministic algorithm decides SAT if it overall accepts if and only if the formula is satisfiable.
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 satisfiability problem1Non-deterministic algorithm1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.