Time and Energy Complexity of Function Computation Over Networks

DOI10.1109/TIT.2011.2168902zbMath1365.94148MaRDI QIDQ5272192

Nikhil Karamchandani, Massimo Franceschetti, Rathinakumar Appuswamy

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analytic circuit theory (94C05) Measures of information, entropy (94A17)

Related Items (1)

Lower bounds for in-network computation of arbitrary functions

This page was built for publication: Time and Energy Complexity of Function Computation Over Networks