Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Parallelism and algorithms for algebraic manipulation: current work
ACM SIGSAM Bulletin
Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics
Finite Fields and Their Applications
| Hi-index | 0.00 |
We present very efficient arithmetic circuits for the computation of the determinants and inverse of band matrices and for interpolation and polynomial arithmetic over arbitrary ground fields. For input size n the circuits for band matrix inversion (for constant band width) over infinite fields, and the circuits for polynomial arithmetic over arbitrary fields, have optimal depth 0(log n) and polynomial size. The algorithm for band matrix inversion is based on an extension of the method of modification (from numerical analysis) which includes a formula for the determinant of a modified matrix.