The complexity of the minimal polynomial

DOI10.1007/3-540-44683-4_36MaRDI QIDQ4779160zbMATH OpenFDO

Authors Thanh Minh Hoang, Thomas Thierauf

Publication date 25 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2136/21360408

Mathematics Subject Classification ID

Matrices of integers (15B36) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• The complexity of the characteristic and the minimal polynomial.
• scientific article; zbMATH DE number 2089958
• ON THE MINIMAL POLYNOMIAL OF A MATRIX
• Computing minimal polynomials of matrices
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms

Cited in

(5)

• The complexity of the characteristic and the minimal polynomial.
• Computing minimal polynomials of matrices
• scientific article; zbMATH DE number 2089958 (Why is no real title available?)
• ON THE MINIMAL POLYNOMIAL OF A MATRIX
• On eigenvalue gaps of integer matrices

This page was built for publication: The complexity of the minimal polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779160)