2026-07-23T20:44:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7538 2024-03-06T10:40:11Z ddc:004 open_access

Query-to-Communication Lifting for P^NP Göös, Mika Kamath, Pritish Pitassi, Toniann Watson, Thomas Communication Complexity Query Complexity Lifting Theorem P^NP We prove that the P^NP-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the P^NP-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 P^NP communication complexity up to polynomial factors, which answers a question of Papakonstantinou, Scheder, and Song (CCC 2014). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mika Göös and Pritish Kamath and Toniann Pitassi and Thomas Watson 2017 Is Part Of LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CCC.2017.12 urn:nbn:de:0030-drops-75388 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.12 eng https://creativecommons.org/licenses/by/3.0/legalcode