Strong NP-Completeness of a Matrix Similarity Problem

Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta. Strong NP-Completeness of a Matrix Similarity Problem. Theoretical Computer Science, 165(2):483-490, 1996. [doi]

Abstract

Abstract is missing.