Lower bound technique for length-reducing automata.
Tomasz JurdzinskiKrzysztof LorysPublished in: Inf. Comput. (2007)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- lower and upper bounds
- worst case
- cellular automata
- optimal solution
- polynomial approximation
- finite state
- fixed length
- upper and lower bounds
- minimum length
- maximum number
- lower bounding
- data sets
- sufficiently accurate
- lagrangian relaxation
- regular expressions
- np hard
- special case