@article{Etessami:2014:NCC:2631196.2601327,
Address = {New York, NY, USA},
Author = {Etessami, Kousha and Stewart, Alistair and Yannakakis, Mihalis},
File = {A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing - Etessami, Stewart, Yannakakis (0) (0) (0) (0) - a - a - t.pdf},
ISSN = {1942-3454},
Journal = {ACM Trans. Comput. Theory},
Keywords = {ABC conjecture, Lang-Waldschmidt conjecture, Succinct representation of numbers, arithmetic circuits, logarithmic forms, probabilistic parsing, stochastic context-free grammars},
Month = {May},
Number = {2},
Pages = {9:1--9:23},
Publisher = {ACM},
Title = {A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing},
URL = {http://doi.acm.org/10.1145/2601327},
Volume = {6},
Year = {2014},
acmid = {2601327},
articleno = {9},
bdsk-url-1 = {http://doi.acm.org/10.1145/2601327},
bdsk-url-2 = {http://dx.doi.org/10.1145/2601327},
date-added = {2014-06-21 05:51:12 +0000},
date-modified = {2014-06-21 05:51:12 +0000},
issue_date = {May 2014},
numpages = {23},
doi = {10.1145/2601327}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A