Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
+Normal rank
@@ Property / cites work @@
+Q5180766
@@ Property / cites work: Q5180766 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On colouring random graphs
@@ Property / cites work: On colouring random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065570
@@ Property / cites work: Q4065570 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Estimation of Sparse Hessian Matrices
@@ Property / cites work: On the Estimation of Sparse Hessian Matrices / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02592052
+Normal rank
@@ Property / OpenAlex ID @@
+W1988783936
@@ Property / OpenAlex ID: W1988783936 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4745216