Strong NP-completeness of a matrix similarity problem

被引:0
|
作者
Brimkov, V [1 ]
Codenotti, B [1 ]
Leoncini, M [1 ]
Resta, G [1 ]
机构
[1] UNIV PISA, DIPARTIMENTO INFORMAT, I-56125 PISA, ITALY
关键词
computational complexity; similarity transformation; condition number;
D O I
10.1016/0304-3975(96)00103-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a tolerance tau greater than or equal to 1, decide whether there exists a nonsingular matrix G, with condition number bounded by tau, such that G(-1) AG is 2 x 2 block diagonal. This problem, which we shall refer to as DICHOTOMY, is an important one in the theory of invariant subspaces. It has recently been proved that DICHOTOMY is NP-complete. In this note we make some progress proving that DICHOTOMY is actually NP-complete in the strong sense. This outlines the ''purely combinatorial'' nature of the difficulty, which might well arise even in case of well scaled matrices with entries of small magnitude.
引用
收藏
页码:483 / 490
页数:8
相关论文
共 50 条
  • [21] On NP-completeness of subset sum problem for Lamplighter group
    Mishchenko, Alexei
    Treier, Alexander
    MECHANICAL SCIENCE AND TECHNOLOGY UPDATE (MSTU-2018), 2018, 1050
  • [22] NP-COMPLETENESS OF SOME GENERALIZATIONS OF THE MAXIMUM MATCHING PROBLEM
    STOCKMEYER, LJ
    VAZIRANI, VV
    INFORMATION PROCESSING LETTERS, 1982, 15 (01) : 14 - 19
  • [23] PROBLEM OF LOWER BOUNDS OF COMPLEXITY AND THE NP-COMPLETENESS THEORY
    NIGMATULLIN, RG
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1981, (05): : 17 - 25
  • [24] The NP-completeness of a tomographical problem on bicolored domino tilings
    Frosini, A
    Simi, G
    THEORETICAL COMPUTER SCIENCE, 2004, 319 (1-3) : 447 - 454
  • [25] NP-completeness of optimal planning problem for modular robots
    Ye, Zipeng
    Yu, Minjing
    Liu, Yong-Jin
    AUTONOMOUS ROBOTS, 2019, 43 (08) : 2261 - 2270
  • [26] NP-completeness of chromatic orthogonal art gallery problem
    Hamid Hoorfar
    Alireza Bagheri
    The Journal of Supercomputing, 2021, 77 : 3077 - 3109
  • [27] Bi-immunity separates strong NP-completeness notions
    Pavan, A
    Selman, AL
    INFORMATION AND COMPUTATION, 2004, 188 (01) : 116 - 126
  • [28] Formulation of mobile agent allocation and its strong NP-completeness
    Sasaki, A
    Araragi, T
    Masuyama, S
    Miyata, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (05): : 1060 - 1063
  • [29] ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY
    Rybalov, A. N.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2020, (47): : 101 - 107
  • [30] 508 Separating NP-completeness notions under strong hypotheses
    Ambos-Spies, K
    Bentzien, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2000, 61 (03) : 335 - 361