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...

We develop a new algorithm to compute determinants of all possible Hankel matrices made up from given finite length sequence over field. Our fits within the dynamic programming paradigm by exploiting recursive relations on together with observations concerning distribution zero among matrix sizes allowed original sequence. The can be used isolate \emph{very} efficiently linear shift feedback re...