Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (Q4498326): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5689624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Checking robust nonsingularity is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of some linear problems with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max / rank | |||
Normal rank | |||
Latest revision as of 12:06, 30 May 2024
scientific article; zbMATH DE number 1491665
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> |
scientific article; zbMATH DE number 1491665 |
Statements
Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (English)
0 references
26 June 2001
0 references
norm
0 references
positive definiteness
0 references
M-matrix
0 references
NP-hard
0 references
polynomial-time algorithm
0 references
