Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325860zbMATHOpenAlexDBLPFDO

Authors Stefan Porschen, Ewald Speckenmeyer, 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical propositional logic (03B05)

Recommendations

• On Some SAT-Variants over Linear Formulas
• XSAT and NAE-SAT of linear CNF classes
• On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}
• NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
• On strongly planar not-all-equal 3SAT

Cited in

(9)

• All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs
• Computing k-modal embeddings of planar digraphs
• On Some SAT-Variants over Linear Formulas
• On simplified NP-complete variants of \textsc{Monotone 3-Sat}
• Complexity Results for Linear XSAT-Problems
• XSAT and NAE-SAT of linear CNF classes
• 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

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325860)