A Nontrivial Lower Bound for an NP Problem on Automata.
Etienne GrandjeanPublished in: SIAM J. Comput. (1990)
Keyphrases
- lower bound
- np hard
- np complete
- upper bound
- branch and bound algorithm
- computational complexity
- branch and bound
- lower and upper bounds
- cellular automata
- regular expressions
- lower bounding
- finite automata
- objective function
- optimal solution
- upper and lower bounds
- finite state machines
- probabilistic automata
- finite state
- lagrangian relaxation
- linear programming relaxation
- worst case
- polynomial approximation
- knapsack problem
- pattern matching
- constraint satisfaction problems
- approximation algorithms
- competitive ratio
- randomized algorithm
- dynamic programming