On the Hardness of Almost-Sure Termination.

Benjamin Lucien Kaminski Joost-Pieter Katoen

Published in: MFCS (1) (2015)

Keyphrases

phase transition
rewrite systems
term rewriting
np hard
computational complexity
np complete
active rules
multi class
worst case
np hardness
learning theory
databases
optimal solution
multiscale
agnostic learning
decision making
data mining