对于极小不可满足公式的子类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.

youdao

本文提出的基于等价类法的形式背景同构判定算法，有效地提高了同构判定的效率。

This paper suggests an isomorphism detecting algorithm based on equivalent class, which improves the efficiency of context isomorphism detection.

youdao

若两状态转换图同构，则两图中的状态均可一一配对为待验证状态对，即所有的代验证状态对均为等价状态对。

If the state transfer graphs are isomorphism, all the states in different graphs can be matched as equal state pairs.

youdao