Yang Cai, Ting Zhang. A Tight Lower Bound for Streett Complementation. In Supratik Chakraborty, Amit Kumar, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India. Volume 13 of LIPIcs, pages 339-350, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. [doi]
@inproceedings{CaiZ11-0,
title = {A Tight Lower Bound for Streett Complementation},
author = {Yang Cai and Ting Zhang},
year = {2011},
doi = {10.4230/LIPIcs.FSTTCS.2011.339},
url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.339},
researchr = {https://researchr.org/publication/CaiZ11-0},
cites = {0},
citedby = {0},
pages = {339-350},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India},
editor = {Supratik Chakraborty and Amit Kumar},
volume = {13},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-34-7},
}