ON THE MINIMAL POLYNOMIAL OF A MATRIX
From MaRDI portal
Publication:5696967
DOI10.1142/S0129054104002327zbMath1081.15521MaRDI QIDQ5696967
Thanh Minh Hoang, Thomas Thierauf
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21)
Cites Work
- On computing the determinant in small parallel time using a small number of processors
- The method of forced enumeration for nondeterministic automata
- Verifying the determinant in parallel
- The complexity of the characteristic and the minimal polynomial.
- The complexity of matrix rank and feasible systems of linear equations
- Matrix Analysis
- Nondeterministic Space is Closed under Complementation
- Fast Parallel Matrix Inversion Algorithms
- Fast parallel matrix and GCD computations
- Making Nondeterminism Unambiguous
- Unnamed Item