@InProceedings{rosenthal:LIPIcs.IPEC.2019.24,
author = {Rosenthal, Gregory},
title = {{Beating Treewidth for Average-Case Subgraph Isomorphism}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.24},
URN = {urn:nbn:de:0030-drops-114850},
doi = {10.4230/LIPIcs.IPEC.2019.24},
annote = {Keywords: subgraph isomorphism, average-case complexity, AC^0, circuit complexity}
}