Computing the norm ∥A∥∞,1 is NP-hard∗ (Q4498326): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/03081080008818644
+Normal rank
@@ Property / OpenAlex ID @@
+W2032711963
@@ Property / OpenAlex ID: W2032711963 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+Checking robust nonsingularity is NP-hard
@@ Property / cites work: Checking robust nonsingularity is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of some linear problems with interval data
+Normal rank
@@ Property / cites work @@
+Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
+Normal rank

Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (Q4498326): Difference between revisions