$(2/2/3)$-SAT problem and its applications in dominating set problems

Arash Ahadi, Ali Dehghan

The satisfiability problem is known to be $\mathbf{NP}$-complete in general and for many restricted cases. One way to restrict instances of $k$-SAT is to limit the number of times…