Kousha Etessami, Alistair Stewart, Mihalis Yannakakis. A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. Electronic Colloquium on Computational Complexity (ECCC), 20:69, 2013. [doi]
@article{EtessamiSY13,
title = {A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing},
author = {Kousha Etessami and Alistair Stewart and Mihalis Yannakakis},
year = {2013},
url = {http://eccc.hpi-web.de/report/2013/069},
researchr = {https://researchr.org/publication/EtessamiSY13},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {20},
pages = {69},
}