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（2007）
摘要
In this paper, we propose a new decision problem, called the concurrently enabled transition set problem, which is proved to be NP-complete by reduction from the independent set problem. Then, we present a polynomial-time algorithm for the maximal concurrently enabled transition set problem, and prove that some special subproblems are in P by the proposed algorithm.
更多查看译文
关键词
transition set problem,independent set problem,new decision problem,maximal concurrently,polynomial-time algorithm,proposed algorithm,special subproblems,computation complexity
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要