@InProceedings{allender_et_al:LIPIcs.ITCS.2018.20,
author = {Allender, Eric and Grochow, Joshua A. and van Melkebeek, Dieter and Moore, Cristopher and Morgan, Andrew},
title = {{Minimum Circuit Size, Graph Isomorphism, and Related Problems}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.20},
URN = {urn:nbn:de:0030-drops-83455},
doi = {10.4230/LIPIcs.ITCS.2018.20},
annote = {Keywords: Reductions between NP-intermediate problems, Graph Isomorphism, Minimum Circuit Size Problem, time-bounded Kolmogorov complexity}
}