Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325860
DOI10.1007/b95238zbMath1204.68108WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325860
Ewald Speckenmeyer, Stefan Porschen, Bert Randerath
Publication date: 24 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95238
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
03B05: Classical propositional logic
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Computing k-modal embeddings of planar digraphs, Absorbing random walks and the NAE2SAT problem, Relating planar graph drawings to planar satisfiability problems, Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy, On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat}, XSAT and NAE-SAT of linear CNF classes