Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR17-024 | 16th February 2017 05:14

#### Query-to-Communication Lifting for P^NP

TR17-024
Authors: Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
Publication: 16th February 2017 13:30
We prove that the $\text{P}^{\small\text{NP}}$-type query complexity (alternatively, decision list width) of any boolean function $f$ is quadratically related to the $\text{P}^{\small\text{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 $\text{P}^{\small\text{NP}}$ communication complexity up to polynomial factors, which answers a question of Papakonstantinou, Scheder, and Song (CCC 2014).