Rectangle Size Bounds and Threshold Covers in Communication Complexity
Hartmut KlauckPublished in: CoRR (2002)
Keyphrases
- space complexity
- worst case
- computational complexity
- upper bound
- network size
- memory requirements
- lower bound
- block size
- window size
- communication cost
- communication networks
- hough transform
- worst case time complexity
- communication overhead
- exponential size
- communication systems
- lower and upper bounds
- upper and lower bounds
- error bounds
- polynomial size