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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Kousha Etessami' in GoogleThis author has not been identified. Look up 'Alistair Stewart' in GoogleThis author has not been identified. Look up 'Mihalis Yannakakis' in Google

runs on WebDSL