Login / Signup
Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets.
Atsushi Ohta
Kohkichi Tsuji
Published in:
SICE (2020)
Keyphrases
</>
computational complexity
special case
np complete
memory requirements
computationally efficient
decision problems
np hard
workflow systems
high computational complexity
workflow management
computational efficiency
low complexity
computational cost
loosely coupled
multi agent systems
website
machine learning