Login / Signup

A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing.

Kousha EtessamiAlistair StewartMihalis Yannakakis
Published in: ACM Trans. Comput. Theory (2014)
Keyphrases
  • natural language
  • computational complexity
  • computational cost
  • conditional probabilities
  • space complexity
  • data sets
  • worst case
  • real time
  • databases
  • social networks
  • evolutionary algorithm
  • pattern matching