pdf-format: |
|
@InProceedings{bringmann:LIPIcs:2019:10243, author = {Karl Bringmann}, title = {{Fine-Grained Complexity Theory (Tutorial)}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {4:1--4:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Rolf Niedermeier and Christophe Paul}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10243}, doi = {10.4230/LIPIcs.STACS.2019.4}, annote = {Keywords: Hardness in P, conditional lower bound, fine-grained reduction} }
Keywords: | Hardness in P, conditional lower bound, fine-grained reduction | |
Seminar: | 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) | |
Issue date: | 2019 | |
Date of publication: | 12.03.2019 |