Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Adleman, L., Manders, K.: Computational Complexity of Decision Procedures for Polynomials. in:Conf.Proceedings of the 16-th IEEE Annual Symp. on Foundat. of Computer Sci., pp 169–177, (1975).
2. Araki, T., Kasami, T.: Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. Theoret. Comp. Sci., 4, pp 99–119, (1977).
3. Baker, B.S., Book, R.V.: Reversal-Bounded Multipushdown Machines. Journ. Comp. Syst. Sci., 8, pp 315–332, (1974).
4. Biryukov, A.P.: Some Algorithmic Problems for Finitely Defined Commutative Semigroups. Siberian Mathematics Journ., 8, pp 384–391, (1967).
5. Cardoza, E., Lipton, R., Meyer, A.R.: Exponential Space Complete Problems for Petri Nets and Commutative Semigroups. in: Conf. Proc. of 8-th Annual ACM Symp. on Theory of Computing, pp 50–54, (1976).
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献