Mika Göös, Stefan Kiefer, Weiqiang Yuan. Lower Bounds for Unambiguous Automata via Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC), 29:15, 2022. [doi]
@article{GoosKY22,
title = {Lower Bounds for Unambiguous Automata via Communication Complexity},
author = {Mika Göös and Stefan Kiefer and Weiqiang Yuan},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/015},
researchr = {https://researchr.org/publication/GoosKY22},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {29},
pages = {15},
}