Pages that link to "Item:Q1100896"
From MaRDI portal
The following pages link to Communication complexity of convex optimization (Q1100896):
Displaying 3 items.
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights (Q2108190) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)
