Strong NP-completeness of a matrix similarity problem

DOI10.1016/0304-3975(96)00103-XzbMATH Open0872.68046OpenAlexW2075320356MaRDI QIDQ671534FDOQ671534

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

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

Recommendations

• Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard
• scientific article; zbMATH DE number 741115
• The P-matrix problem is co-NP-complete

zbMATH Keywords

computational complexitycondition numbersimilarity transformation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• An \(NC^ 2\) algorithm for testing similarity of matrices
• Title not available (Why is that?)
• Strong NP-completeness of a matrix similarity problem

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

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