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?

 
  • 考慮判定問(wèn)題“對于給定的CNF公式H和F是否存在一個(gè)變元(或文字)改名;使得(H)=F?” 的計算復雜性.
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan