COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
From MaRDI portal
Publication:4853329
DOI10.1142/S0129054194000165zbMath0830.68061OpenAlexW1987631685MaRDI QIDQ4853329
Publication date: 29 October 1995
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054194000165
Related Items (7)
The Complexity of Diagonalization ⋮ Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time ⋮ Continuous-time orbit problems are decidable in polynomial-time ⋮ Counting and generating permutations in regular classes ⋮ Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
This page was built for publication: COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
