Login / Signup
Lower Bounds for One-way Probabilistic Communication Complexity.
Farid M. Ablayev
Published in:
ICALP (1993)
Keyphrases
</>
lower bound
worst case
upper bound
probabilistic model
bayesian networks
branch and bound algorithm
information sharing
objective function
computational cost
uncertain data
lower and upper bounds
lower bounding
average case complexity
complexity measures
max sat
communication systems
computer networks