Complexity Results for Linear XSAT-Problems
From MaRDI portal
Publication:4930593
DOI10.1007/978-3-642-14186-7_21zbMath1306.68046MaRDI QIDQ4930593
Ewald Speckenmeyer, Tatjana Schmidt, Stefan Porschen
Publication date: 29 September 2010
Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_21
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items