1. Angarsson, S., Kandri-Rody, A., Kapur, D., Narendran, P., and Saunders, B.D., “The Complexity of Testing whether a Polynomial Ideal is Nontrivial,” Proceedings of the Third MACSYMA User's Conference, Schenectady, NY, July, 1984, pp. 452–458.
2. Ballantyne, A.M., and Lankford, D.S., “New Decision Algorithms for Finitely Presented Commutative Semigroups,” Computer and Mathematics with Applications Vol. 7 pp. 159–165, 1981.
3. Buchberger, B., An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (in German), Ph.D. Thesis, Univ. of Innsbruck, Austria, Math., Inst., 1965.
4. Buchberger, B., “A Critical-Pair/Completion Algorithm in Reduction Rings,” Proc. Logic and Machines: Decision Problems and Complexity, (eds. by E. Borger, G. Hasenjaeger, D. Rodding), Spring LNCS 171, pp 137–161, 1984.
5. Computing Suppl.;B. Buchberger,1982