Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325860
DOI10.1007/b95238zbMath1204.68108OpenAlexW2494235144WikidataQ56039662 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy ⋮ Relating planar graph drawings to planar satisfiability problems ⋮ XSAT and NAE-SAT of linear CNF classes ⋮ On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} ⋮ Absorbing random walks and the NAE2SAT problem ⋮ Computing k-modal embeddings of planar digraphs
This page was built for publication: Theory and Applications of Satisfiability Testing
