Communication complexity towards lower bounds on circuit depth.
Jeff EdmondsRussell ImpagliazzoSteven RudichJirí SgallPublished in: Comput. Complex. (2001)
Keyphrases
- lower bound
- worst case
- upper bound
- high speed
- complexity measures
- branch and bound algorithm
- branch and bound
- average case complexity
- electronic circuits
- computational cost
- optimal solution
- objective function
- depth information
- communication channels
- communication overhead
- quadratic assignment problem
- information sharing