On Local Versus Global Satisfiability
From MaRDI portal
Publication:4652606
DOI10.1137/S0895480197326528zbMath1101.68063MaRDI QIDQ4652606
Publication date: 28 February 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
A new bound for 3-satisfiable MaxSat and its algorithmic application ⋮ Partial Satisfaction of k-Satisfiable Formulas ⋮ Complexity of partial satisfaction. II. ⋮ A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications ⋮ On cyclic and nontransitive probabilities ⋮ A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application ⋮ Locally consistent constraint satisfaction problems
This page was built for publication: On Local Versus Global Satisfiability
