On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2117680112
@@ Property / OpenAlex ID: W2117680112 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Information Transfer in Distributed Computations
+Normal rank
@@ Property / cites work @@
+Q4001523
@@ Property / cites work: Q4001523 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Complexity Results for Matrix Computations on Parallel Processors
+Normal rank
@@ Property / cites work @@
+On the Communication Complexity of Solving a Polynomial Equation
+Normal rank
@@ Property / cites work @@
+Q3967358
@@ Property / cites work: Q3967358 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040887
@@ Property / cites work: Q4040887 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity of the Gaussian elimination algorithm on multiprocessors
+Normal rank
@@ Property / cites work @@
+Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
+Normal rank
@@ Property / cites work @@
+Q3993279
@@ Property / cites work: Q3993279 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity of convex optimization
@@ Property / cites work: Communication complexity of convex optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank