One-way communication complexity and the Neciporuk lower bound on formula size
Hartmut KlauckPublished in: CoRR (2001)
Keyphrases
- lower bound
- worst case
- upper bound
- space complexity
- computational complexity
- objective function
- branch and bound
- branch and bound algorithm
- optimal solution
- network size
- memory requirements
- average case complexity
- communication networks
- lower and upper bounds
- complexity analysis
- computational cost
- search algorithm
- communication cost
- information sharing
- communication technologies
- average case
- space requirements
- lower bounding
- constant factor
- propositional formulas