Communication Complexity Towards Lower Bounds on Circuit Depth
Jeff EdmondsSteven RudichRussell ImpagliazzoJirí SgallPublished in: FOCS (1991)
Keyphrases
- lower bound
- worst case
- upper bound
- average case complexity
- high speed
- computational complexity
- communication systems
- branch and bound
- communication overhead
- depth information
- communication networks
- depth map
- objective function
- stereo matching
- real time
- branch and bound algorithm
- communication channels
- average case
- complexity measures
- neural network
- computer networks
- information sharing
- special case
- lower and upper bounds
- optimal cost