Isomorphic Implication

MFCS'05: Proceedings of the 30th international conference on Mathematical Foundations of Computer Science（2007）

引用 0|浏览1

暂无评分

摘要

We study the isomorphic implication problem for Boolean constraints. We show that this is a natural analog of the subgraph isomorphism problem. We prove that, depending on the set of constraints, this problem is in P, or is NP-complete, or is NP-hard, coNP-hard, and in P ‖ NP . We show how to extend the NP-hardness and coNP-hardness to P ‖ NP -hardness for some cases, and conjecture that this can be done in all cases.

查看译文

关键词

Computational complexity,Propositional logic,Constraints,Isomorphism problem,Logic in computer science

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要