Restricted Machines Presented by Muhannad Harrim.
Consider this SAT problem: (x1 or x2 or x3) AND (¬x1 or ¬x2) AND (¬x1 or ¬x3 ) AND (¬x2 or ¬x3)
Restricted Machines