论文信息 - Computing the norm ∥A∥∞,1 is NP-hard - 字舞流文

Computing the norm ∥A∥∞,1 is NP-hard

It is proved that computing the subordinate matrix norm ∥A∥∞1 is NP-hard, Even more, existence of a polynomial-time algorithm for computing this norm with relative accuracy less than 1/(4n2 ), where n is matrix size, implies P = NP.

[1] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Gene H. Golub,et al. Matrix computations , 1983 .

[4] Pham Dinh Tao. Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum , 1984 .

[5] Svatopluk Poljak,et al. Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..

[6] Robert J. Plemmons,et al. Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[7] J. Rohn. Checking positive definiteness or stability of symmetric interval matrices is NP-hard , 1994 .

[8] J. Rohn. Complexity of Some Linear Problems with Interval Data , 1997 .