Pages that link to "Item:Q671534"
From MaRDI portal
The following pages link to Strong NP-completeness of a matrix similarity problem (Q671534):
Displaying 4 items.
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- An \(NC^ 2\) algorithm for testing similarity of matrices (Q1116651) (← links)
- Band-restricted diagonally dominant matrices: computational complexity and application (Q1713483) (← links)
- Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard (Q1908896) (← links)