English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

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;

Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/21.11116/0000-0002-16FB-B
Abstract
There is no abstract available