SIGACT news complexity theory comun 37
ACM SIGACT News
On computation complexity of the concurrently enabled transition set problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Hi-index | 0.00 |