Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity.
Irit DinurOr MeirPublished in: Computational Complexity Conference (2016)
Keyphrases
- lower bound
- worst case
- upper bound
- computational complexity
- lower and upper bounds
- communication networks
- b spline
- branch and bound algorithm
- communication overhead
- decision problems
- communication channels
- average case complexity
- learning algorithm
- randomly generated problems
- complexity measures
- quadratic assignment problem
- computer networks
- linear programming
- scheduling problem
- computational cost
- search algorithm
- objective function