Skip to content

Tree-depth and the Formula Complexity of Subgraph Isomorphism.

Deepanshu Kush, Benjamin Rossman

VenueA*FOCS
Year2020
ProceedingsFOCS

Browse the full FOCS paper archive.