Document Open Access Logo

Lifting with Inner Functions of Polynomial Discrepancy

Authors Yahel Manor, Or Meir



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2022.26.pdf
  • Filesize: 0.68 MB
  • 17 pages

Document Identifiers

Author Details

Yahel Manor
  • Department of Computer Science, University of Haifa, Israel
Or Meir
  • Department of Computer Science, University of Haifa, Israel

Cite AsGet BibTex

Yahel Manor and Or Meir. Lifting with Inner Functions of Polynomial Discrepancy. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 26:1-26:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.26

Abstract

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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Communication complexity
  • Theory of computation → Oracles and decision trees
Keywords
  • Lifting
  • communication complexity
  • query complexity
  • discrepancy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Anurag Anshu, Shalev Ben-David, and Srijita Kundu. On query-to-communication lifting for adversary bounds. In Valentine Kabanets, editor, 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference), volume 200 of LIPIcs, pages 30:1-30:39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  2. Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. How to compress interactive communication. In STOC, pages 67-76, 2010. Google Scholar
  3. Paul Beame, Toniann Pitassi, Nathan Segerlind, and Avi Wigderson. A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pages 52-66. IEEE Computer Society, 2005. Google Scholar
  4. Mark Braverman. Interactive information complexity. In STOC, pages 505-524, 2012. Google Scholar
  5. Mark Braverman and Anup Rao. Information equals amortized communication. In FOCS, pages 748-757, 2011. Google Scholar
  6. Mark Braverman and Omri Weinstein. A discrepancy lower bound for information complexity. In APPROX-RANDOM, pages 459-470, 2012. Google Scholar
  7. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Chi-Chih Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In FOCS, pages 270-278, 2001. Google Scholar
  8. Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, and Toniann Pitassi. Query-to-communication lifting using low-discrepancy gadgets. Electronic Colloquium on Computational Complexity (ECCC), 26:103, 2019. Google Scholar
  9. Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay. Simulation theorems via pseudorandom properties. CoRR, abs/1704.06807, 2017. Google Scholar
  10. Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay. Simulation beats richness: new data-structure lower bounds. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 1013-1020, 2018. Google Scholar
  11. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, and Robert Robere. KRW composition theorems via lifting. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 43-49. IEEE, 2020. Google Scholar
  12. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, and Marc Vinyals. Lifting with simple gadgets and applications to circuit and proof complexity. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20), November 2020. Also available as ECCC TR19-186. Google Scholar
  13. Tomás Feder, Eyal Kushilevitz, Moni Naor, and Noam Nisan. Amortized communication complexity. SIAM J. Comput., 24(4):736-750, 1995. Google Scholar
  14. Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov. Monotone circuit lower bounds from resolution. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 902-911, 2018. Google Scholar
  15. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman. Rectangles are nonnegative juntas. In Rocco A. Servedio and Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 257-266. ACM, 2015. Google Scholar
  16. Mika Göös and Toniann Pitassi. Communication lower bounds via critical block sensitivity. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages 847-856. ACM, 2014. Google Scholar
  17. Mika Göös, Toniann Pitassi, and Thomas Watson. Deterministic communication vs. partition number. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS '17), pages 1077-1088, 2015. Google Scholar
  18. Mika Göös, Toniann Pitassi, and Thomas Watson. Query-to-communication lifting for BPP. In Proceedings of IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 132-143, 2017. Google Scholar
  19. Hamed Hatami, Kaave Hosseini, and Shachar Lovett. Structure of protocols for XOR functions. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pages 282-288. IEEE Computer Society, 2016. Google Scholar
  20. Rahul Jain. New strong direct product results in communication complexity. Electronic Colloquium on Computational Complexity (ECCC), 18:24, 2011. Google Scholar
  21. Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. A direct sum theorem in communication complexity via message compression. In ICALP, pages 300-315, 2003. Google Scholar
  22. Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. Prior entanglement, message compression and privacy in quantum communication. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pages 285-296. IEEE Computer Society, 2005. Google Scholar
  23. Mauricio Karchmer, Eyal Kushilevitz, and Noam Nisan. Fractional covers and communication complexity. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22-25, 1992, pages 262-274. IEEE Computer Society, 1992. Google Scholar
  24. Mauricio Karchmer, Ran Raz, and Avi Wigderson. Super-logarithmic depth lower bounds via direct sum in communication coplexity. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991, pages 299-304. IEEE Computer Society, 1991. Google Scholar
  25. Nikos Leonardos and Michael E. Saks. Lower bounds on the randomized communication complexity of read-once functions. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009, pages 341-350. IEEE Computer Society, 2009. Google Scholar
  26. Toniann Pitassi and Robert Robere. Strongly exponential lower bounds for monotone computation. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC '17), pages 1246-1255, 2017. Google Scholar
  27. Toniann Pitassi and Robert Robere. Lifting Nullstellensatz to monotone span programs over any field. In Ilias Diakonikolas, David Kempe, and Monika Henzinger, editors, Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC '18), pages 1207-1219. ACM, 2018. Google Scholar
  28. Ran Raz and Pierre McKenzie. Separation of the monotone NC hierarchy. In 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pages 234-243, 1997. Google Scholar
  29. Ran Raz and Pierre McKenzie. Separation of the monotone NC hierarchy. Combinatorica, 19(3):403-435, 1999. Google Scholar
  30. Robert Robere, Toniann Pitassi, Benjamin Rossman, and Stephen A. Cook. Exponential lower bounds for monotone span programs. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS '16), pages 406-415, 2016. Google Scholar
  31. Ronen Shaltiel. Towards proving strong direct product theorems. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pages 107-117. IEEE Computer Society, 2001. Google Scholar
  32. Alexander A. Sherstov. The pattern matrix method (journal version). CoRR, abs/0906.4291, 2009. URL: http://arxiv.org/abs/0906.4291.
  33. Alexander A. Sherstov. Strong direct product theorems for quantum communication and query complexity. In Lance Fortnow and Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 41-50. ACM, 2011. Google Scholar
  34. Yaoyun Shi and Yufan Zhu. Quantum communication complexity of block-composed functions. Quantum Information & Computation, 9(5):444-460, 2009. URL: http://www.rintonpress.com/xxqic9/qic-9-56/0444-0460.pdf.
  35. Xiaodi Wu, Penghui Yao, and Henry S. Yuen. Raz-McKenzie simulation with the inner product gadget. Electronic Colloquium on Computational Complexity (ECCC), 24:10, 2017. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail