| dc.contributor.author | Göös, Mika | |
| dc.contributor.author | Kamath, Pritish | |
| dc.contributor.author | Pitassi, Toniann | |
| dc.contributor.author | Watson, Thomas | |
| dc.date.accessioned | 2021-09-20T17:20:17Z | |
| dc.date.available | 2021-09-20T17:20:17Z | |
| dc.date.issued | 2018-11-30 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/131537 | |
| dc.description.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). | en_US |
| dc.publisher | Springer International Publishing | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/s00037-018-0175-5 | en_US |
| dc.rights | 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. | en_US |
| dc.source | Springer International Publishing | en_US |
| dc.title | Query-to-Communication Lifting for PNP | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2020-09-24T21:12:09Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Nature Switzerland AG | |
| dspace.embargo.terms | Y | |
| dspace.date.submission | 2020-09-24T21:12:09Z | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | |
