Satisfiability problem (SAT problem)

programming

Statement

Sat Problem

Given a boolean function $f$ in CNF with $n$ variables and $m$ clauses. Is there a true/false assignment to the $n$ variables that satisfies $f$. If yes then output it, otherwise say no.

Solutions

Related

Theory