Tree-Depth and the Formula Complexity of Subgraph Isomorphism

Deepanshu Kush, Benjamin Rossman. Tree-Depth and the Formula Complexity of Subgraph Isomorphism. SIAM Journal on Computing, 52(1):273-325, February 2023. [doi]

Abstract

Abstract is missing.