Login / Signup
Lower Bounds on the Size of Sweeping Automata.
Juraj Hromkovic
Georg Schnitger
Published in:
J. Autom. Lang. Comb. (2009)
Keyphrases
</>
lower bound
upper bound
running times
branch and bound
lower and upper bounds
neural network
computational complexity
worst case
memory requirements
finite state machines
lattice gas
constant factor
online algorithms
boolean functions
combinatorial optimization
cellular automata
np hard
optimal solution