New Bounds for MAX-SAT by Clause Learning
From MaRDI portal
Publication:3499776
DOI10.1007/978-3-540-74510-5_21zbMath1188.68272OpenAlexW2029489766MaRDI QIDQ3499776
Konstantin Kutzkov, Alexander S. Kulikov
Publication date: 3 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74510-5_21
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP ⋮ Improved exact algorithms for mildly sparse instances of MAX SAT ⋮ A new upper bound for Max-2-SAT: A graph-theoretic approach ⋮ New upper bounds for the problem of maximal satisfiability ⋮ A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between ⋮ Solving sparse instances of Max SAT via width reduction and greedy restriction ⋮ A new upper bound for \(( n , 3)\)-MAX-SAT ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach ⋮ A refined branching algorithm for the maximum satisfiability problem
Uses Software
This page was built for publication: New Bounds for MAX-SAT by Clause Learning
