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]

Possibly Related Publications

The following publications are possibly variants of this publication: