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...
Solving sparse semi-random instances of Max-Cut and Max-CSP in linear expected time (2004)
Er D Scott, Gregory B. Sorkin, Alexander D. Scott, B. Sorkin
been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be...