Amir Abboud, Karl Bringmann. Tighter Connections Between Formula-SAT and Shaving Logs. In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella, editors, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Volume 107 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{AbboudB18-0,
title = {Tighter Connections Between Formula-SAT and Shaving Logs},
author = {Amir Abboud and Karl Bringmann},
year = {2018},
doi = {10.4230/LIPIcs.ICALP.2018.8},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.8},
researchr = {https://researchr.org/publication/AbboudB18-0},
cites = {0},
citedby = {0},
booktitle = {45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and Dániel Marx and Donald Sannella},
volume = {107},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-076-7},
}