On the Approximability of Splitting-SAT in 2-CNF Horn Formulas

DOI10.1007/978-3-642-45278-9_6zbMath1407.68205OpenAlexW153539009MaRDI QIDQ2870016

Lucia Keller, Hans-Joachim Böckenhauer

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/156327

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: On the Approximability of Splitting-SAT in 2-CNF Horn Formulas