Query-to-Communication Lifting for PNP
Name
37_2018_175_ReferencePDF.pdf
Size
609.97 KB
Format
Adobe PDF
Checksum (MD5)
b86db407646a2632940026ca632c2ba3
Author(s)
Göös, Mika
Kamath, Pritish
Pitassi, Toniann
Watson, Thomas
Date Issued
November 30, 2018
Publisher
Springer International Publishing
Version
Author's final manuscript
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).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00037-018-0175-5
