Simple but Hard Mixed Horn Formulas
From MaRDI portal
Publication:4931561
DOI10.1007/978-3-642-14186-7_36zbMath1306.68041OpenAlexW1494952976MaRDI QIDQ4931561
Gayathri Namasivayam, Miroslaw Truszczynski
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_36
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)