同构蕴涵
Isomorphic Implication
摘要：
研究了布尔约束的同构蕴涵问题。我们表明，这是一个自然的模拟子图同构问题。我们证明，根据一组约束，这个问题是在P，NP-完全，或NP-硬，coNP-硬，并在并行访问NP。我们将展示如何扩展NP-硬度和coNP-硬度硬度的并行访问NP的某些情况下，并推测，这可以在所有情况下完成。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
