minimal unsatisfiable problem
·2,447,543篇论文数据，部分数据来源于NoteExpress
-
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.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
youdao
更多双语例句