Solving sparse instances of Max SAT via width reduction and greedy restriction

From MaRDI portal
Publication:905695

DOI10.1007/s00224-014-9600-6zbMath1347.68312OpenAlexW1983672233MaRDI QIDQ905695

Suguru Tamaki, Takayuki Sakai, Kazuhisa Seto

Publication date: 28 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9600-6




Related Items (2)


Uses Software


Cites Work


This page was built for publication: Solving sparse instances of Max SAT via width reduction and greedy restriction