@inproceedings{Kush_2020,<br/><span class="tab"></span> title={Tree-depth and the Formula Complexity of Subgraph Isomorphism},<br/><span class="tab"></span> url={http://dx.doi.org/10.1109/focs46700.2020.00012},<br/><span class="tab"></span> DOI={10.1109/focs46700.2020.00012},<br/><span class="tab"></span> booktitle={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},<br/><span class="tab"></span> publisher={IEEE},<br/><span class="tab"></span> author={Kush,<br/><span class="tab"></span> Deepanshu and Rossman,<br/><span class="tab"></span> Benjamin},<br/><span class="tab"></span> year={2020},<br/><span class="tab"></span> month=nov }