Author:
Kaltofen Erich,Krishnamoorthy M. S.,Saunders B. David
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Chou, T. J. and Collins, G. E., “Algorithms for the solution of systems of diophantine linear equations,” SIAM J. Comp., vol. 11, pp. 687–708, 1982.
2. Cook, S. A., “A taxonomy of problems with fast parallel algorithms,” Inf. Control, vol. 64, pp. 2–22, 1985.
3. Iliopoulos, C. S., “Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix,” Manuscript, Purdue Univ., 1986.
4. Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D., “Fast parallel algorithms for similarity of matrices,” Proc. 1986 ACM Symp. Symbolic Algebraic Comp., pp. 65–70, 1986.
5. Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D., “Fast parallel computation of Hermite and Smith forms of polynomial matrices,” SIAM J. Alg. Discrete Meth., vol. 8, pp. 683–690, 1987.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献