2026-07-23T19:19:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17148 2024-03-06T10:59:05Z ddc:004 open_access

Lifting with Inner Functions of Polynomial Discrepancy Manor, Yahel Meir, Or Lifting communication complexity query complexity discrepancy Lifting theorems are theorems that bound the communication complexity of a composed function f∘gⁿ 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yahel Manor and Or Meir 2022 Is Part Of LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.APPROX/RANDOM.2022.26 urn:nbn:de:0030-drops-171486 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.26 eng https://creativecommons.org/licenses/by/4.0/legalcode