Lifting theorems are theorems that bound the communication complexity of a composed function fogn in terms of the query complexity of f and the communication complexity of g. Such theorems constitute a powerful generalization of direct-sum theorems for g, and have seen numerous applications in recent years. We prove a new lifting theorem that works for every two functions f, g such that the discrepancy of g is at most inverse polynomial in the input length of f. Our result is a significant generalization of the known direct-sum theorem for discrepancy, and extends the range of inner functions g for which lifting theorems hold.
|Title of host publication||Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022|
|Editors||Amit Chakrabarti, Chaitanya Swamy|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - 1 Sep 2022|
|Event||25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022 - Virtual, Urbana-Champaign, United States|
Duration: 19 Sep 2022 → 21 Sep 2022
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022|
|Period||19/09/22 → 21/09/22|
Bibliographical noteFunding Information:
Funding Yahel Manor: Supported by the Israel Science Foundation (grant No. 716/20). Or Meir: Partially supported by the Israel Science Foundation (grant No. 716/20).
© Yahel Manor and Or Meir.
- communication complexity
- query complexity
ASJC Scopus subject areas