On strongly planar 3SAT

Lidong Wu ()
Additional contact information
Lidong Wu: University of Texas at Tyler

Journal of Combinatorial Optimization, 2016, vol. 32, issue 1, No 19, 293-298

Abstract: 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.

Keywords: Planar 3SAT; NP-complete; Optimization problems (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9878-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9878-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9878-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().