Computational Complexity of Some Restricted Instances of 3SAT (2008)
Piotr Berman, Marek Karpinski Alex, Er D. Scott
Tovey [10] showed that it is NP-hard to decide the satisfiability of 3-SAT instances in which every variable occurs four times, while every instance of 3-SAT in which each variable occurs three times...