Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity.
Arkadev ChattopadhyayRajit DattaPartha MukhopadhyayPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- lower bound
- upper bound
- worst case
- complexity measures
- high speed
- communication systems
- computational complexity
- np hard
- objective function
- branch and bound
- branch and bound algorithm
- communication networks
- arithmetic operations
- decision problems
- average case complexity
- optimal solution
- digital circuits
- communication cost
- sample size