"Tree-depth and the Formula Complexity of Subgraph Isomorphism."

Deepanshu Kush, Benjamin Rossman (2020)

Details and statistics

DOI: 10.1109/FOCS46700.2020.00012

access: closed

type: Conference or Workshop Paper

metadata version: 2021-01-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics