Strong NP-completeness of a matrix similarity problem

DOI10.1016/0304-3975(96)00103-XzbMath0872.68046OpenAlexW2075320356MaRDI QIDQ671534

Valentin E. Brimkov, Mauro Leoncini, Giovanni Resta, Bruno Codenotti

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00103-x

zbMATH Keywords

computational complexitycondition numbersimilarity transformation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Strong NP-completeness of a matrix similarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong NP-completeness of a matrix similarity problem
• Checking robust nonsingularity is NP-hard
• Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard
• An Algorithm for Computing Reducing Subspaces by Block Diagonalization
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
• Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard

This page was built for publication: Strong NP-completeness of a matrix similarity problem