The complexity of the characteristic and the minimal polynomial.

DOI10.1016/S0304-3975(02)00404-8zbMath1045.68067MaRDI QIDQ1401240

Thanh Minh Hoang, Thomas Thierauf

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Linear algebraCharacteristic polynomialComputational complexityInvariant factorsLogspace counting classesMinimal polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

The orbit problem is in the GapL hierarchy ⋮ The Orbit Problem Is in the GapL Hierarchy ⋮ ON THE MINIMAL POLYNOMIAL OF A MATRIX ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comments on ``Arithmetic complexity, Kleene closure, and formal power series
• The complexity of computing the permanent
• On computing the determinant in small parallel time using a small number of processors
• A combinatorial approach to matrix algebra
• The method of forced enumeration for nondeterministic automata
• Verifying the determinant in parallel
• Gap-definable counting classes
• Fast parallel algorithms for matrix reduction to normal forms
• The complexity of matrix rank and feasible systems of linear equations
• A taxonomy of problems with fast parallel algorithms
• Matrix Analysis
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Nondeterministic Space is Closed under Complementation
• The Complexity of Enumeration and Reliability Problems
• Determinant: Old Algorithms, New Insights

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