On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
A taxonomy of problems with fast parallel algorithms
Information and Control
Matrix analysis
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Fast parallel computation of hermite and smith forms of polynomial matrices
SIAM Journal on Algebraic and Discrete Methods
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Gap-definable counting classes
Journal of Computer and System Sciences
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An O(n3) algorithm for the Frobenius normal form
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Verifying the determinant in parallel
Computational Complexity
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity
Determinant: Old Algorithms, New Insights
SIAM Journal on Discrete Mathematics
Making nondeterminism unambiguous
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the Minimal Polynomial of a Matrix
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Orbit Problem Is in the GapL Hierarchy
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The orbit problem is in the GapL hierarchy
Journal of Combinatorial Optimization
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |
We investigate the complexity of (1) computing the characteristic polynomial, the minimal polynomial, and all the invariant factors of an integer matrix, and of (2) verifying them, when the coefficients are given as input.It is known that each coefficient of the characteristic polynomial of a matrix A is computable in GapL, and the constant term, the determinant of A, is complete for GapL. We show that the verification of the characteristic polynomial is complete for complexity class C=L (exact counting logspace).We show that each coefficient of the minimal polynomial of a matrix A can be computed in AC0(GapL), the AC0-closure of GapL, and there is a coefficient which is hard for GapL. Furthermore, the verification of the minimal polynomial is in AC0(C=L) and is hard for C=L. The hardness result extends to (computing and verifying) the system of all invariant factors of a matrix.