1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading MA (1974)
2. Borosh, I., and L.B. Treybig, “Bounds on positive integral solutions of linear Diophantine equations,” Proc. AMS
55 (1976) 299–304.
3. Condon, A., and Ladner, R.E., “Probabilistic Game Automata,” JCSS
36 (1988) 452–489.
4. Cai, J, Lipton, R.J., and Zalcstein,Y., “The complexity of the membership problem for 2-generated commutative semigroups of rational matrix”, Proc. of FOCS'94 (1994) 135–142.
5. Condon, A., “Computational Models of Games,” (An ACM distinguished Dissertation 1988) MIT Press, Cambridge, MA (1989).