Tree-depth and the Formula Complexity of Subgraph Isomorphism

Deepanshu Kush, Benjamin Rossman. Tree-depth and the Formula Complexity of Subgraph Isomorphism. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. pages 31-42, IEEE, 2020. [doi]

Authors

Deepanshu Kush

This author has not been identified. Look up 'Deepanshu Kush' in Google

Benjamin Rossman

This author has not been identified. Look up 'Benjamin Rossman' in Google