Tighter Connections Between Formula-SAT and Shaving Logs

Abboud, Amir; Bringmann, Karl

doi:10.4230/LIPIcs.ICALP.2018.8

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2642890_4

DetailsSummary

Released

Conference Paper

Tighter Connections Between Formula-SAT and Shaving Logs

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/9012/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Abboud, A., & Bringmann, K. (2018). Tighter Connections Between Formula-SAT and Shaving Logs. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (pp. 1-18). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2018.8.

Cite as: https://hdl.handle.net/21.11116/0000-0002-16FB-B

Abstract

There is no abstract available