We first observe that NP-completeness immediately follows forCNFSAT and SAT since 3SAT ≤p CNFSAT ≤p SAT . Note that 3SAT ⊂ CNFSAT ⊂ SAT . The reduction in each case is almost the identity (though of course it can’t be since the sets are different). The only issue is that we have to modify satisfiable formulas that are not in 3CNF. For the 3SAT ≤p CNFSAT reduction we simply map any input that is...

Monotone 3-Sat-4 is a variant of the satisfiability problem for boolean formulae in conjunctive normal form. In this variant, each clause contains exactly three literals—either all or none of them are positive, i. e., no clause contains both a positive and a negative literal—and every variable appears at most four times in the formula. Moreover, every clause consists of three distinct literals....

In this paper, Ag/ZnO/HZSM-5ternary nanocomposites with different Ag loadings were prepared by the photo precipitation method. The prepared photocatalysts were characterized by XRD, BET, SEM and TEM. The photocatalytic activity of ZnO/HZSM-5 for 4-nitrophenol (4-NP) degradation was increased by silver doping. Effects of various parameters such as the initial concentration of 4-NP, pH and Ag loa...