Algorithms – ESA 2005
From MaRDI portal
Publication:5475823
DOI10.1007/11561071zbMath1162.68461OpenAlexW2501059503MaRDI QIDQ5475823
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
An Improved SAT Algorithm in Terms of Formula Length ⋮ Further improvements for SAT in terms of formula length ⋮ A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances ⋮ A new upper bound for \(( n , 3)\)-MAX-SAT ⋮ On the complexity of unique circuit SAT ⋮ Unnamed Item ⋮ Dealing with 4-variables by resolution: an improved MaxSAT algorithm ⋮ An improvement of the algorithm of Hertli for the unique 3SAT problem ⋮ Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences ⋮ A fast algorithm for SAT in terms of formula length
