ON THE MINIMAL POLYNOMIAL OF A MATRIX
From MaRDI portal
Publication:5696967
DOI10.1142/S0129054104002327zbMATH Open1081.15521MaRDI QIDQ5696967FDOQ5696967
Authors: Thanh Minh Hoang, Thomas Thierauf
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Canonical forms, reductions, classification (15A21) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Nondeterministic Space is Closed under Complementation
- On computing the determinant in small parallel time using a small number of processors
- The method of forced enumeration for nondeterministic automata
- Fast parallel matrix and GCD computations
- Making Nondeterminism Unambiguous
- The complexity of matrix rank and feasible systems of linear equations
- Fast Parallel Matrix Inversion Algorithms
- The complexity of the characteristic and the minimal polynomial.
- Verifying the determinant in parallel
Cited In (11)
- Solution of an Equation in a Linear Algebra by Means of the Minimal Polynomial
- On multivariate minimal polynomials
- Title not available (Why is that?)
- The relations between the minimal annihilation polynomial of vector in a matrix and the characteristic of the complex matrix \(A\)
- Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
- Minimal polynomial of Cayley graph adjacency matrix for Boolean functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of the characteristic and the minimal polynomial.
- Minimal height companion matrices for Euclid polynomials
- On the minimum polynomial of supermatrices
This page was built for publication: ON THE MINIMAL POLYNOMIAL OF A MATRIX
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696967)