Tree-depth and the formula complexity of subgraph isomorphism

DOI10.1109/FOCS46700.2020.00012MaRDI QIDQ6944045zbMATH OpenFDO

Authors Benjamin Rossman, Deepanshu Kush

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00012

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

This page was built for publication: Tree-depth and the formula complexity of subgraph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944045)