Login / Signup
A simpler 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:
CoRR (2019)
Keyphrases
</>
learning algorithm
dynamic programming
computational complexity
np hard
worst case
artificial intelligence
objective function
optimal solution
social networks
knowledge base
search algorithm
transition systems