The Synthesis Problem for Elementary Net Systems is NP-Complete.

Éric Badouel Luca Bernardinello Philippe Darondeau

Published in: Theor. Comput. Sci. (1997)

Keyphrases

np complete
computational complexity
satisfiability problem
learning systems
complex systems
randomly generated
data sets
social networks
information systems
expert systems
intelligent systems