Login / Signup
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
Kousha Etessami
Alistair Stewart
Mihalis Yannakakis
Published in:
CoRR (2013)
Keyphrases
</>
natural language
computational complexity
data sets
databases
probability distribution
natural language processing
pattern matching
machine learning
search engine
website
unsupervised learning
decision problems
complexity analysis
lower complexity