Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries-Reference-Cited by-同舟云学术

Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

Published:1976-09 Issue:3 Volume:2 Page:232-241
ISSN:0098-3500
Container-title:ACM Transactions on Mathematical Software
language:en
Short-container-title:ACM Trans. Math. Softw.

Author:

Gentleman W. M.¹,Johnson S. C.²

Affiliation:

1. Mathematics Faculty Computing Faculty, University of Waterloo, Waterloo, Ont., Canada

2. Bell Telephone Laboratories, Murray Hill, NJ

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Reference5 articles.

1. ~dentlty and multistep integer-preserving Gaussian ehmination;BAREISS E H;Math. Computatwn,1968

2. FATEMAN R.J. On the computational powers of polynomials. Dep. Math. Rep. M.I.T. Cambridge Mass. FATEMAN R.J. On the computational powers of polynomials. Dep. Math. Rep. M.I.T. Cambridge Mass.

3. Computation of powers of multivariate polynomials over the integers;HEINDEL L.E;J. Computer Syst. Sci.,1972

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Black Box Factorization Algorithm - the Non-monic Case;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

2. Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation;Mathematics in Computer Science;2022-09

3. Initialization Algorithms for Convolutional Network Coding;IEEE Transactions on Information Theory;2018-07

4. Parallel Computations;Mathematical Geosciences;2018

5. Computing the Determinant of a Matrix with Polynomial Entries by Approximation;Journal of Systems Science and Complexity;2017-05-02