On the Hardness of Almost-Sure Termination.

Benjamin Lucien Kaminski Joost-Pieter Katoen

Published in: CoRR (2015)

Keyphrases

phase transition
computational complexity
learning theory
np complete
np hard
term rewrite systems
worst case
rewrite systems
term rewriting
image sequences
termination analysis
multi class
np hardness
agnostic learning
information theoretic
data sets
multi agent
web services