Tree-depth and the Formula Complexity of Subgraph Isomorphism

Deepanshu Kush, Benjamin Rossman. Tree-depth and the Formula Complexity of Subgraph Isomorphism. Electronic Colloquium on Computational Complexity (ECCC), 27:61, 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