๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Mimicking Networks

โœ Scribed by S. Chaudhuri; K. V. Subrahmanyam; F. Wagner; C. D. Zaroliagis


Book ID
106149270
Publisher
Springer
Year
2000
Tongue
English
Weight
147 KB
Volume
26
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Complex networks and computing
โœ Zhou, Shuigeng ;Zhang, Zhongzhi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Higher Education Press and Springer ๐ŸŒ English โš– 236 KB
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