On strongly planar 3SAT

DOI10.1007/S10878-015-9878-6zbMath1354.90117OpenAlexW2038161080MaRDI QIDQ328723

Lidong Wu

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9878-6

zbMATH Keywords

optimization problemsNP-completeplanar 3SAT

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

On strongly planar not-all-equal 3SAT ⋮ On caterpillar factors in graphs

Cites Work

• Planar 3DM is NP-complete
• Planar Formulae and Their Uses

This page was built for publication: On strongly planar 3SAT