Isomorphic Implication
计算复杂性
2007-05-23 v2
摘要
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, NP-complete, or NP-hard, coNP-hard, and in parallel access to NP. We show how to extend the NP-hardness and coNP-hardness to hardness for parallel access to NP for some cases, and conjecture that this can be done in all cases.
引用
@article{arxiv.cs/0412062,
title = {Isomorphic Implication},
author = {Michael Bauland and Edith Hemaspaandra},
journal= {arXiv preprint arXiv:cs/0412062},
year = {2007}
}
备注
22 pages; corrected typos and minor errors