Query-to-communication lifting for PNP
We prove that the PNP-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the PNP-type communication complexity of a lifted version of f. As an application, we show that a certain "product" lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture PNP communication complexity up to polynomial factors, which answers a question of Papakonstantinou, Scheder, and Song (CCC 2014).
Leibniz International Proceedings in Informatics, LIPIcs
Göös, M., Kamath, P., Pitassi, T., & Watson, T. (2017). Query-to-communication lifting for PNP. Leibniz International Proceedings in Informatics, LIPIcs, 79 https://doi.org/10.4230/LIPIcs.CCC.2017.12