Two Lower Bounds on Computational Complexity of Infinite Words.
Juraj HromkovicJuhani KarhumäkiPublished in: New Trends in Formal Languages (1997)
Keyphrases
- lower bound
- computational complexity
- np hard
- upper bound
- high computational complexity
- worst case
- np complete
- branch and bound
- n gram
- branch and bound algorithm
- optimal solution
- special case
- objective function
- related words
- lower and upper bounds
- decision problems
- computational efficiency
- keywords
- vc dimension
- quadratic assignment problem
- word sense disambiguation
- upper and lower bounds
- lower bounding
- randomly generated problems
- english words
- memory requirements
- sample complexity
- motion estimation