Skip to main content
SpringerLink
Log in

On Planar Boolean CSP

  • Conference paper
  • First Online:
Book cover Automata, Languages, and Programming (ICALP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9134))

Included in the following conference series:

Abstract

We give a partial classification of the complexity of Planar Boolean CSP, including a complete dichotomy for templates containing only relations of arity at most \(5\).

Z. Dvořák—Supported by project GA14-19503S (Graph coloring and structure) of Czech Science Foundation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 595–603. IEEE Computer Society, Washington, DC (2009)

    Google Scholar 

  2. Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing 38(5), 1782–1802 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM (JACM) 53(1), 66–120 (2006)

    Article  MathSciNet  Google Scholar 

  4. Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34(3), 720–742 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cai, J.Y., Lu, P., Xia, M.: Holographic algorithms with matchgates capture precisely tractable planar #CSP. In: Proceedings of the 2010 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 427–436. IEEE Computer Society, Washington, DC (2010)

    Google Scholar 

  6. Dalmau, V., Ford, D.K.: Generalized satisfiability with limited occurrences per variable: a study through delta-matroid parity. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 358–367. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449–467 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  8. Feder, T.: Fanout limitations on constraint systems. Theor. Comput. Sci. 255, 281–293 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28(1), 57–104 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Geelen, J.F., Iwata, S., Murota, K.: The linear Delta-matroid parity problem. Journal of Combinatorial Theory, Series B 88(2), 377–398 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Guo, H., Williams, T.: The complexity of planar boolean #CSP with complex weights. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 516–527. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Istrate, G.: Looking for a version of Schaefer’s dichotomy theorem when each variable occurs at most twice, technical Report TR652, The University of Rochester (1997)

    Google Scholar 

  13. Mac Lane, S.: A structural characterization of planar combinatorial graphs. Duke Mathematical Journal 3, 460–472 (1937)

    Article  MATH  MathSciNet  Google Scholar 

  14. Moret, B.M.E.: Planar NAE3SAT is in P. SIGACT News 19(2), 51–54 (1988)

    Article  Google Scholar 

  15. Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2) (2008)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, Charles University in Prague, Prague, Czech Republic

    Zdeněk Dvořák & Martin Kupec

Authors
  1. Zdeněk Dvořák
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Kupec
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zdeněk Dvořák .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dvořák, Z., Kupec, M. (2015). On Planar Boolean CSP. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47672-7_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47671-0

  • Online ISBN: 978-3-662-47672-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation