There are a number of classes of mathematical objects for which the problem of isomorphism is a GI-complete problem.

有一些类型的数学对象的问题，这是一个同构起完整的问题。

youdao

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

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