Supported by the National Natural Science Foundation of China (Grant No. 69973013)
A new model for the well-known problem, the satisfiablility problem of boolean formula (SAT), is introduced. Based on this model, some variants of SAT and their properties are presented. Denote by NP the class of all ...