Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems

DOI10.1007/978-3-642-22685-4_5zbMath1348.68234OpenAlexW173813963MaRDI QIDQ3087938

Shaohan Ma, Pingping Zhang, Daming Zhu

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Local Search to Approximate Max NAE-$$k$$-Sat Tightly ⋮ Approximating Max NAE-\(k\)-SAT by anonymous local search

This page was built for publication: Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems