Computational complexity of some restricted instances of 3-SAT

DOI10.1016/j.dam.2006.07.009zbMath1111.68044MaRDI QIDQ875598

Marek Karpinski, Piotr Berman, Alexander D. Scott

Publication date: 13 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.009

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)