Home / Computer science
A special case of SAT with
exactly three literals per clause.
The problem is NP-complete.