Fine-Grained Complexity Theory (Tutorial)

Bringmann, Karl

doi:10.4230/LIPIcs.STACS.2019.4

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fine-Grained Complexity Theory (Tutorial)

MPS-Authors

/persons/resource/persons44182

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

External Resource

http://drops.dagstuhl.de/opus/volltexte/2019/10243/
(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

Bringmann, K. (2019). Fine-Grained Complexity Theory (Tutorial). In R. Niedermeier, & C. Paul (Eds.), 36th Symposium on Theoretical Aspects of Computer Science (pp. 1-7). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.STACS.2019.4.

Cite as: https://hdl.handle.net/21.11116/0000-0003-B36E-8

Abstract

There is no abstract available