This paper formulates a distributed computation problem, where master asks ${\mathsf N}$ workers to compute linearly separable function. The task function can be expressed as K}_{\mathrm{ c}}$ linear combinations of K}$ messages, each message is one dataset. Our objective find the optimal tradeoff between cost (number unco...