Login / Signup
An O(m log n) algorithm for branching bisimilarity on labelled transition systems.
David N. Jansen
Jan Friso Groote
Jeroen J. A. Keiren
Anton Wijs
Published in:
TACAS (2) (2020)
Keyphrases
</>
learning algorithm
optimal solution
computational complexity
np hard
dynamic programming
worst case
reinforcement learning
hidden markov models
sufficient conditions