A satisfiability algorithm and average-case hardness for formulas over the full binary basis
From MaRDI portal
Publication:354655
DOI10.1007/s00037-013-0067-7zbMath1286.68208MaRDI QIDQ354655
Publication date: 19 July 2013
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/189761
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)