Skip to main content
SpringerLink
Log in

On strongly planar 3SAT

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The strongly planar 3SAT problem is NP-complete. This fact is proved in a book (Du et al. in Introduction to computational complexity theory, 2002). We show that the strongly planar 1-in-3SAT and strongly planar not-all-equal 3SAT problems are also NP-complete. They are very useful in study of combinatorial optimization problems in a plane.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Tyler, Tyler, TX, 75799, USA

    Lidong Wu

Authors
  1. Lidong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lidong Wu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, L. On strongly planar 3SAT. J Comb Optim 32, 293–298 (2016). https://doi.org/10.1007/s10878-015-9878-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9878-6

Keywords

Search

Navigation