Deepanshu Kush, Benjamin Rossman. Tree-depth and the Formula Complexity of Subgraph Isomorphism. Electronic Colloquium on Computational Complexity (ECCC), 27:61, 2020. [doi]
@article{KushR20,
title = {Tree-depth and the Formula Complexity of Subgraph Isomorphism},
author = {Deepanshu Kush and Benjamin Rossman},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/061},
researchr = {https://researchr.org/publication/KushR20},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {27},
pages = {61},
}