This paper suggests an isomorphism detecting algorithm based on equivalent class, which improves the efficiency of context isomorphism detection.
本文提出的基于等价类法的形式背景同构判定算法,有效地提高了同构判定的效率。
2
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.