Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang. On the Cut Dimension of a Graph. In Valentine Kabanets, editor, 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference). Volume 200 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{LeeLSZ21,
title = {On the Cut Dimension of a Graph},
author = {Troy Lee and Tongyang Li and Miklos Santha and Shengyu Zhang},
year = {2021},
doi = {10.4230/LIPIcs.CCC.2021.15},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.15},
researchr = {https://researchr.org/publication/LeeLSZ21},
cites = {0},
citedby = {0},
booktitle = {36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)},
editor = {Valentine Kabanets},
volume = {200},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-193-1},
}