Rectangle Size Bounds and Threshold Covers in Communication Complexity.
Hartmut KlauckPublished in: Computational Complexity Conference (2003)
Keyphrases
- worst case
- space complexity
- lower bound
- worst case time complexity
- upper bound
- computational complexity
- window size
- communication systems
- worst case bounds
- block size
- memory requirements
- communication networks
- information sharing
- error bounds
- information exchange
- computer networks
- communication technologies
- upper and lower bounds
- hough transform
- neural network
- complexity analysis
- multi party
- resource constrained
- exponential size
- computational cost
- support vector