Query-to-Communication Lifting for PNP

Author(s)
Göös, Mika; Kamath, Pritish; Pitassi, Toniann; Watson, Thomas
Thumbnail
Download37_2018_175_ReferencePDF.pdf (609.9Kb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Abstract 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).
Date issued
2018-11-30
URI
https://hdl.handle.net/1721.1/131537
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Publisher
Springer International Publishing
Collections