Distributed Computing on Anonymous Hyper
โ
Evangelos Kranakis; Danny Krizanc
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 245 KB
We consider the bit-complexity i.e.a, total number of bits transmitted of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are inv