This paper investigates the complexity of decision problem: for propositional CNF formulas H and F, does there exist a variable (or literal) renaming such that (H)=F?

• 考虑判定问题“对于给定的CNF公式H和F是否存在一个变元(或文字)改名；使得(H)=F?” 的计算复杂性.