是子句数与变元数的差等于1的极小不可满足公式类。
Mu (1) is a class of minimal unsatisfiable formulas with the deficiency of the number of clauses and.
是子句数与变元数的差等于1的极小不可满足公式类。
Mu (1) is a class of minimal unsatisfiable formulas with the deficiency of the number of clauses and variables to be one.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
应用推荐