Exact Max 2-Sat: Easier and Faster

DOI10.1007/978-3-540-69507-3_22zbMath1131.68522OpenAlexW2112116769MaRDI QIDQ5448778

Shiva Prasad Kasiviswanathan, Martin Fuerer

Publication date: 7 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_22

Mathematics Subject Classification ID

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

Related Items (5)

New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree ⋮ Linear-programming design and analysis of fast algorithms for Max 2-CSP ⋮ New exact algorithms for the 2-constraint satisfaction problem ⋮ Unnamed Item ⋮ Solving NP-Complete Problems with Quantum Search

This page was built for publication: Exact Max 2-Sat: Easier and Faster