%0 Conference Paper %1 conf/sat/SakaiST14 %A Sakai, Takayuki %A Seto, Kazuhisa %A Tamaki, Suguru %B SAT %D 2014 %E Sinz, Carsten %E Egly, Uwe %I Springer %K dblp %P 32-47 %T Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. %U http://dblp.uni-trier.de/db/conf/sat/sat2014.html#SakaiST14 %V 8561 %@ 978-3-319-09283-6

@inproceedings{conf/sat/SakaiST14, added-at = {2023-09-30T00:00:00.000+0200}, author = {Sakai, Takayuki and Seto, Kazuhisa and Tamaki, Suguru}, biburl = {https://www.bibsonomy.org/bibtex/28a5edfce78f549fb1016b747eb548cb4/dblp}, booktitle = {SAT}, crossref = {conf/sat/2014}, editor = {Sinz, Carsten and Egly, Uwe}, ee = {https://doi.org/10.1007/978-3-319-09284-3_4}, interhash = {53c5e0c89e21174a311f5fb960fb26c4}, intrahash = {8a5edfce78f549fb1016b747eb548cb4}, isbn = {978-3-319-09283-6}, keywords = {dblp}, pages = {32-47}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T09:01:47.000+0200}, title = {Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.}, url = {http://dblp.uni-trier.de/db/conf/sat/sat2014.html#SakaiST14}, volume = 8561, year = 2014 }