Login / Signup
Communication Lower Bounds Using Dual Polynomials
Alexander A. Sherstov
Published in:
CoRR (2008)
Keyphrases
</>
lower bound
upper bound
np hard
branch and bound algorithm
branch and bound
information sharing
objective function
communication networks
upper and lower bounds
quadratic assignment problem
computer networks
communication overhead
primal dual
vc dimension
communication systems
worst case
computational complexity