Login / Signup
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks.
Hirotada Kobayashi
Keiji Matsumoto
Seiichiro Tani
Published in:
PODC (2009)
Keyphrases
</>
network structure
social networks
neural network
complex networks
real time
decision trees
np hard
np complete
computer networks
community structure
network size