A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing

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]

Abstract

Abstract is missing.