The Structure and Complexity of MAX-MU(2)
Xiaoping Xu · 2006
SAT Problem is a core problem in theoretical computer science.There are many ways to research into SAT Problem.Using the properties of minimal unsatisfiable formulas to study SAT Problem is a new hot way of research at present.In this paper,the structure and complexity of maximal minimal unsatisfiable formulas with deficiency 2(MAX-MU(2)) are studied by(1,*)-resolution and splitting technique.