Tight Lower Bounds on the Size of Sweeping Automata.
Hing LeungPublished in: J. Comput. Syst. Sci. (2001)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- branch and bound
- running times
- constant factor
- np hard
- lower and upper bounds
- objective function
- optimal solution
- cellular automata
- quadratic assignment problem
- max sat
- probabilistic automata
- linear programming relaxation
- optimal cost
- database
- upper and lower bounds
- vc dimension
- finite state
- sample size
- genetic algorithm
- neural network
- data sets