Computing the norm ∥A∥∞,1 is NP-hard
By Jiri Rohn. 2000
54 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/6a32dcd6f7c28badec9c1c7fba1fb4b84c3bfffc
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
Citations in the corpus
- Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory (2005, unknown): “See [490] and [280, p.”
- On the Complexity of Robust PCA and ℓ1-norm Low-Rank Matrix Approximation (2015, unknown): “We partition the solution (u, v) into k blocks (Kup ,K v p ) for 1 ≤ p ≤ k such that for all i ∈ Kup and j ∈ Kvp ui = ±αp and vj = ± 1 αp .”
- Linear Optimization Problems with Inexact Data (2006, background): “One might hope to find an essentially better formula for ‖A‖∞,1, but such an attempt is not likely to succeed due to the following complexity result proved again in [165].”
- Forty necessary and sufficient conditions for regularity of interval matrices: A survey (2009, background): “And fourth, it implies that an interval matrix of the form [Ac − pqT ,A c + pqT ], where p, q are nonnegative column vectors in Rn, is regular if and only if TqA−1 c Tp ∞,1 22 ] for the norm · ∞,1).”