Isomorphic Implication

被引：0
|
作者：
Michael Bauland
Edith Hemaspaandra
机构：
[1] Universität Hannover,Theoretische Informatik
[2] Rochester Institute of Technology,Department of Computer Science
来源：
Theory of Computing Systems | 2009年 / 44卷
关键词：
Computational complexity; Propositional logic; Constraints; Isomorphism problem; Logic in computer science;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：117 / 139
页数：22
相关论文
共 50 条
12345