Lower Bounds on the Size of Sweeping Automata.

Published in: J. Comput. Syst. Sci. (1980)

Keyphrases

lower bound
upper bound
branch and bound algorithm
cellular automata
running times
worst case
finite state
quadratic assignment problem
objective function
np hard
memory requirements
uniform distribution
vc dimension
small size