Reachability in Register Machines with Polynomial Updates.

Alain Finkel Stefan Göller Christoph Haase

Published in: MFCS (2013)

Keyphrases

scheduling problem
parallel machines
low order
state space
image processing
high order
hidden markov models
higher order
learning machines
transitive closure
frequent updates