Skip to main content
SpringerLink
Log in

Isomorphic Implication

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM J. Comput. 30(3), 990–1009 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: constraint satisfaction problems. SIGACT News 35(1), 22–35 (2004)

    Article  Google Scholar 

  3. Buss, S., Hay, L.: On truth-table reducibility to SAT. Inf. Comput. 91(1), 86–102 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence and isomorphism for Boolean constraint satisfaction. In: Proceedings of the 16th Annual Conference of the EACSL (CSL 2002). Lecture Notes in Computer Science, vol. 2471, pp. 412–426. Springer, Berlin (2002)

    Google Scholar 

  5. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: The complexity of Boolean constraint isomorphism. Technical Report cs.CC/0306134, Computing Research Repository, http://www.acm.org/repository/, June 2003. Revised, April 2004

  6. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: The complexity of Boolean constraint isomorphism. In: Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2996, pp. 164–175. Springer, Berlin (2004)

    Google Scholar 

  7. Borchert, B., Ranjan, D.: The circuit subfunction relations are Σ p2 -complete. Technical Report MPI-I-93-121, MPI, Saarbrücken (1993)

  8. Borchert, B., Ranjan, D., Stephan, F.: On the computational complexity of some classical equivalence relations on Boolean functions. Theory Comput. Syst. 31(6), 679–693 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Inf. Comput. 125, 1–12 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  11. Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151–158. ACM, New York (1971)

    Chapter  Google Scholar 

  12. Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. Syst. Sci. 51, 511–522 (1995)

    Article  MathSciNet  Google Scholar 

  13. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  14. Hemaspaandra, E.: Dichotomy theorems for alternation-bounded quantified Boolean formulas. Technical Report cs.CC/0406006, Computing Research Repository, http://www.acm.org/repository/, June 2004

  15. Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2), 2–13 (1997)

    Article  Google Scholar 

  16. Hemaspaandra, E., Wechsung, G.: The minimization problem for Boolean formulas. SIAM J. Comput. 31(6), 1948–1958 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J. ACM 44(4), 527–548 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  18. Juban, L.: Dichotomy theorem for generalized unique satisfiability problem. In: Proceedings of the 12th Conference on Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 1684, pp. 327–337. Springer, Berlin (1999)

    Chapter  Google Scholar 

  19. Kirousis, L., Kolaitis, P.: The complexity of minimal satisfiability problems. Inf. Comput. 187(1), 20–39 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kavvadias, D., Sideri, M.: The inverse satisfiability problem. SIAM J. Comput. 28(1), 152–163 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  21. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Basel (1993)

    MATH  Google Scholar 

  22. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863–1920 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Post, E.: Recursively enumerable sets of integers and their decision problems. Bull. AMS 50, 284–316 (1944)

    Article  MATH  MathSciNet  Google Scholar 

  24. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing, pp. 216–226 (1978)

  25. Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51(1–2), 53–80 (1987)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik, Universität Hannover, Appelstr. 4, 30167, Hannover, Germany

    Michael Bauland

  2. Department of Computer Science, Rochester Institute of Technology, Rochester, NY, 14623, USA

    Edith Hemaspaandra

Authors
  1. Michael Bauland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edith Hemaspaandra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Edith Hemaspaandra.

Additional information

Supported in part by grants NSF-CCR-0311021 and DFG VO 630/5-1 and VO 630/5-2. An extended abstract of this paper appears in Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), pp. 119–130, Springer-Verlag Lecture Notes in Computer Science #3618, August 2005.

Work of M. Bauland done in part while visiting CASCI’s Laboratory for Complexity at Rochester Institute of Technology.

Work of E. Hemaspaandra done in part while on sabbatical at the University of Rochester.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bauland, M., Hemaspaandra, E. Isomorphic Implication. Theory Comput Syst 44, 117–139 (2009). https://doi.org/10.1007/s00224-007-9038-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9038-1

Keywords

Search

Navigation