Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
Parallel algorithms for algebraic problems
SIAM Journal on Computing
Fast algorithms for the characteristic polynomial
Theoretical Computer Science
A taxonomy of problems with fast parallel algorithms
Information and Control
Theory of linear and integer programming
Theory of linear and integer programming
The parallel complexity of exponentiating polynomials over finite fields
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Parallel arithmetic computations: a survey
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
An NC2 algorithm for testing similarity of matrices
Information Processing Letters
Fast parallel computation of hermite and smith forms of polynomial matrices
SIAM Journal on Algebraic and Discrete Methods
Computation of the Smith normal form of polynomial matrices
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Nearly optimal algorithms for canonical matrix forms
Nearly optimal algorithms for canonical matrix forms
Nearly Optimal Algorithms For Canonical Matrix Forms
SIAM Journal on Computing
Algebraic Extensions and Algebraic Closure in Scratchpad II
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
About a New Method for Computing in Algebraic Number Fields
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Efficient parallelizations of Hermite and Smith normal form algorithms
Parallel Computing
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
A local construction of the Smith normal form of a matrix polynomial
Journal of Symbolic Computation
| Hi-index | 0.00 |
We establish that the Smith normal form of a polynomial matrix in Fxn×n , where F is an arbitrary commutative field, can be computed in NCF .