Abstract
The complexity class ZPPNP[1] (corresponding to zero-error randomized algorithms with access to one NP oracle query) is known to have a number of curious properties. We further explore this class in the settings of time complexity, query complexity, and communication complexity.
• For starters, we provide a new characterization: ZPPNP[1] equals the restriction of BPPNP[1] where the algorithm is only allowed to err when it forgoes the opportunity to make an NP oracle query.
• Using the above characterization, we prove a query-to-communication lifting theorem, which translates any ZPPNP[1] decision tree lower bound for a function f into a ZPPNP[1] communication lower bound for a two-party version of f.
• As an application, we use the above lifting theorem to prove that the ZPPNP[1] communication lower bound technique introduced by Göös, Pitassi, and Watson (ICALP 2016) is not tight. We also provide a “primal” characterization of this lower bound technique as a complexity class.
- Scott Aaronson and Andris Ambainis. 2018. Forrelation: A problem that optimally separates quantum from classical computing. SIAM J. Comput. 47, 3 (2018), 982--1038. DOI:https://doi.org/10.1137/15M1050902Google Scholar
Cross Ref
- Scott Aaronson, Shalev Ben-David, and Robin Kothari. 2016. Separations in query complexity using cheat sheets. In Proceedings of the 48th Symposium on Theory of Computing (STOC’16). ACM, 863--876. DOI:https://doi.org/10.1145/2897518.2897644Google Scholar
Digital Library
- Andris Ambainis, Martins Kokainis, and Robin Kothari. 2016. Nearly optimal separations between communication (or query) complexity and partitions. In Proceedings of the 31st Computational Complexity Conference (CCC’16). Schloss Dagstuhl, 4:1--4:14. DOI:https://doi.org/10.4230/LIPIcs.CCC.2016.4Google Scholar
Digital Library
- Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, and Miklos Santha. 2016. Separations in communication complexity using cheat sheets and information complexity. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS’16). IEEE, 555--564. DOI:https://doi.org/10.1109/FOCS.2016.66Google Scholar
Cross Ref
- Yakov Babichenko and Aviad Rubinstein. 2017. Communication complexity of approximate nash equilibria. In Proceedings of the 49th Symposium on Theory of Computing (STOC’17). ACM, 878--889. DOI:https://doi.org/10.1145/3055399.3055407Google Scholar
Digital Library
- Shalev Ben-David, Pooya Hatami, and Avishay Tal. 2017. Low-sensitivity functions from unambiguous certificates. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS’17). Schloss Dagstuhl, 28:1--28:23. DOI:https://doi.org/10.4230/LIPIcs.ITCS.2017.28Google Scholar
- Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, and Jan Johannsen. 2000. On the relative complexity of resolution refinements and cutting planes proof systems. SIAM J. Comput. 30, 5 (2000), 1462--1484. DOI:https://doi.org/10.1137/S0097539799352474Google Scholar
Digital Library
- Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, and Prashant Vasudevan. 2017. On the power of statistical zero knowledge. In Proceedings of the 58th Symposium on Foundations of Computer Science (FOCS’17). IEEE, 708--719. DOI:https://doi.org/10.1109/FOCS.2017.71Google Scholar
Cross Ref
- Harry Buhrman and Ronald de Wolf. 2002. Complexity measures and decision tree complexity: A survey. Theoretical Comput. Sci. 288, 1 (2002), 21--43. DOI:https://doi.org/10.1016/S0304-3975(01)00144-XGoogle Scholar
Digital Library
- Harry Buhrman, Nikolai Vereshchagin, and Ronald de Wolf. 2007. On computation and communication with small bias. In Proceedings of the 22nd Conference on Computational Complexity (CCC’07). IEEE, 24--32. DOI:https://doi.org/10.1109/CCC.2007.18Google Scholar
Digital Library
- Jin-Yi Cai and Venkatesan Chakaravarthy. 2006. On zero error algorithms having oracle access to one query. J. Combinator. Optimiz. 11, 2 (2006), 189--202. DOI:https://doi.org/10.1007/s10878-006-7130-0Google Scholar
Cross Ref
- Siu On Chan, James Lee, Prasad Raghavendra, and David Steurer. 2016. Approximate constraint satisfaction requires large LP relaxations. J. ACM 63, 4 (2016), 34:1--34:22. DOI:https://doi.org/10.1145/2811255Google Scholar
Digital Library
- Richard Chang and Suresh Purini. 2008. Amplifying ZPPSAT[1] and the two queries problem. In Proceedings of the 23rd Conference on Computational Complexity (CCC’08). IEEE, 41--52. DOI:https://doi.org/10.1109/CCC.2008.32Google Scholar
- Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay. 2018. Simulation beats richness: New data-structure lower bounds. In Proceedings of the 50th Symposium on Theory of Computing (STOC’18). ACM, 1013--1020. DOI:https://doi.org/10.1145/3188745.3188874Google Scholar
Digital Library
- Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay. 2019. Simulation theorems via pseudo-random properties. Comput. Complex. 28, 4 (2019), 617--659. DOI:https://doi.org/10.1007/s00037-019-00190-7Google Scholar
Cross Ref
- Susanna de Rezende, Jakob Nordström, and Marc Vinyals. 2016. How limited interaction hinders real communication (and what it means for proof and circuit complexity). In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS’16). IEEE, 295--304. DOI:https://doi.org/10.1109/FOCS.2016.40Google Scholar
Cross Ref
- Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov. 2018. Monotone circuit lower bounds from resolution. In Proceedings of the 50th Symposium on Theory of Computing (STOC’18). ACM, 902--911. DOI:https://doi.org/10.1145/3188745.3188838Google Scholar
Digital Library
- Mika Göös. 2015. Lower bounds for clique vs. independent set. In Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS’15). IEEE, 1066--1076. DOI:https://doi.org/10.1109/FOCS.2015.69Google Scholar
Digital Library
- Mika Göös, T. S. Jayram, Toniann Pitassi, and Thomas Watson. 2018. Randomized communication vs. partition number. ACM Trans. Comput. Theory 10, 1 (2018), 4:1--4:20. DOI:https://doi.org/10.1145/3170711Google Scholar
Digital Library
- Mika Göös, Pritish Kamath, Toniann Pitassi, and Thomas Watson. 2019. Query-to-communication lifting for PNP. Comput. Complex. 28, 1 (2019), 113--144. DOI:https://doi.org/10.1007/s00037-018-0175-5Google Scholar
Digital Library
- Mika Göös, Pritish Kamath, Robert Robere, and Dmitry Sokolov. 2019. Adventures in monotone complexity and TFNP. In Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS’19). Schloss Dagstuhl, 38:1--38:19. DOI:https://doi.org/10.4230/LIPIcs.ITCS.2019.38Google Scholar
- Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman. 2016. Rectangles are nonnegative juntas. SIAM J. Comput. 45, 5 (2016), 1835--1869. DOI:https://doi.org/10.1137/15M103145XGoogle Scholar
Cross Ref
- Mika Göös and Toniann Pitassi. 2018. Communication lower bounds via critical block sensitivity. SIAM J. Comput. 47, 5 (2018), 1778--1806. DOI:https://doi.org/10.1137/16M1082007Google Scholar
Digital Library
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2017. Query-to-communication lifting for BPP. In Proceedings of the 58th Symposium on Foundations of Computer Science (FOCS’17). IEEE, 132--143. DOI:https://doi.org/10.1109/FOCS.2017.21Google Scholar
Cross Ref
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2018. Deterministic communication vs. partition number. SIAM J. Comput. 47, 6 (2018), 2435--2450. DOI:https://doi.org/10.1137/16M1059369 Special issue for selected papers from FOCS 2015.Google Scholar
Cross Ref
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2018. The landscape of communication complexity classes. Computat. Complex. 27, 2 (2018), 245--304. DOI:https://doi.org/10.1007/s00037-018-0166-6Google Scholar
Digital Library
- Mika Göös and Aviad Rubinstein. 2018. Near-optimal communication lower bounds for approximate Nash equilibria. In Proceedings of the 59th Symposium on Foundations of Computer Science (FOCS). IEEE, 397--403. DOI:https://doi.org/10.1109/FOCS.2018.00045Google Scholar
Cross Ref
- Mika Göös and Thomas Watson. 2016. Communication complexity of set-disjointness for all probabilities. Theory Comput. 12, 1 (2016), 1--23. DOI:https://doi.org/10.4086/toc.2016.v012a009 Special issue for selected papers from APPROX--RANDOM 2014.Google Scholar
- Bernd Halstenberg and Rüdiger Reischuk. 1990. Relations between communication complexity classes. J. Comput. Syst. Sci. 41, 3 (1990), 402--429. DOI:https://doi.org/10.1016/0022-0000(90)90027-IGoogle Scholar
Digital Library
- Russell Impagliazzo and Ryan Williams. 2010. Communication complexity with synchronized clocks. In Proceedings of the 25th Conference on Computational Complexity (CCC’10). IEEE, 259--269. DOI:https://doi.org/10.1109/CCC.2010.32Google Scholar
Digital Library
- Jan Johannsen. 2001. Depth lower bounds for monotone semi-unbounded fan-in circuits. RAIRO—Theoret. Info. Appl. 35 (2001), 277--286. DOI:https://doi.org/10.1051/ita:2001120Google Scholar
- Stasys Jukna. 2012. Boolean Function Complexity: Advances and Frontiers. Algorithms and Combinatorics, Vol. 27. Springer.Google Scholar
Digital Library
- Hartmut Klauck. 2003. Rectangle size bounds and threshold covers in communication complexity. In Proceedings of the 18th Conference on Computational Complexity (CCC’03). IEEE, 118--134. DOI:https://doi.org/10.1109/CCC.2003.1214415Google Scholar
Cross Ref
- Hartmut Klauck. 2007. Lower bounds for quantum communication complexity. SIAM J. Comput. 37, 1 (2007), 20--46. DOI:https://doi.org/10.1137/S0097539702405620Google Scholar
Digital Library
- Hartmut Klauck. 2011. On arthur merlin games in communication complexity. In Proceedings of the 26th Conference on Computational Complexity (CCC’11). IEEE, 189--199. DOI:https://doi.org/10.1109/CCC.2011.33Google Scholar
Digital Library
- Pravesh Kothari, Raghu Meka, and Prasad Raghavendra. 2017. Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs. In Proceedings of the 49th Symposium on Theory of Computing (STOC’17). ACM, 590--603. DOI:https://doi.org/10.1145/3055399.3055438Google Scholar
Digital Library
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press.Google Scholar
Digital Library
- James Lee, Prasad Raghavendra, and David Steurer. 2015. Lower bounds on the size of semidefinite programming relaxations. In Proceedings of the 47th Symposium on Theory of Computing (STOC’15). ACM, 567--576. DOI:https://doi.org/10.1145/2746539.2746599Google Scholar
Digital Library
- Ilan Newman. 1991. Private vs. common random bits in communication complexity. Inform. Process. Lett. 39, 2 (1991), 67--71. DOI:https://doi.org/10.1016/0020-0190(91)90157-DGoogle Scholar
Digital Library
- Ryan O’Donnell and A. C. Cem Say. 2018. The weakness of CTC qubits and the power of approximate counting. ACM Trans. Comput. Theory 10, 2 (2018), 5:1--5:22. DOI:https://doi.org/10.1145/3196832Google Scholar
Digital Library
- Periklis Papakonstantinou, Dominik Scheder, and Hao Song. 2014. Overlays and limited memory communication. In Proceedings of the 29th Conference on Computational Complexity (CCC’14). IEEE, 298--308. DOI:https://doi.org/10.1109/CCC.2014.37Google Scholar
Digital Library
- Toniann Pitassi and Robert Robere. 2017. Strongly exponential lower bounds for monotone computation. In Proceedings of the 49th Symposium on Theory of Computing (STOC’17). ACM, 1246--1255. DOI:https://doi.org/10.1145/3055399.3055478Google Scholar
Digital Library
- Toniann Pitassi and Robert Robere. 2018. Lifting nullstellensatz to monotone span programs over any field. In Proceedings of the 50th Symposium on Theory of Computing (STOC’18). ACM, 1207--1219. DOI:https://doi.org/10.1145/3188745.3188914Google Scholar
Digital Library
- Toniann Pitassi, Morgan Shirley, and Thomas Watson. 2020. Nondeterministic and randomized Boolean hierarchies in communication complexity. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP’20). Schloss Dagstuhl, 92:1--92:19. DOI:https://doi.org/10.4230/LIPIcs.ICALP.2020.92Google Scholar
- Anup Rao and Amir Yehudayoff. 2020. Communication Complexity and Applications. Cambridge University Press.Google Scholar
- Ran Raz and Pierre McKenzie. 1999. Separation of the monotone NC hierarchy. Combinatorica 19, 3 (1999), 403--435. DOI:https://doi.org/10.1007/s004930050062Google Scholar
Digital Library
- Robert Robere, Toniann Pitassi, Benjamin Rossman, and Stephen Cook. 2016. Exponential lower bounds for monotone span programs. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS’16). IEEE, 406--415. DOI:https://doi.org/10.1109/FOCS.2016.51Google Scholar
Cross Ref
- Tim Roughgarden and Omri Weinstein. 2016. On the communication complexity of approximate fixed points. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS’16). IEEE, 229--238. DOI:https://doi.org/10.1109/FOCS.2016.32Google Scholar
Cross Ref
- Alexander Sherstov. 2011. The pattern matrix method. SIAM J. Comput. 40, 6 (2011), 1969--2000. DOI:https://doi.org/10.1137/080733644Google Scholar
Digital Library
- Rahul Tripathi. 2010. The 1-versus-2 queries problem revisited. Theory Comput. Syst. 46, 2 (2010), 193--221. DOI:https://doi.org/10.1007/s00224-008-9126-xGoogle Scholar
Digital Library
- Nikolai Vereshchagin. 1999. Relativizability in complexity theory. In Provability, Complexity, Grammars. AMS Translations, Series 2, Vol. 192. American Mathematical Society, 87--172.Google Scholar
- Thomas Watson. 2019. Amplification with one NP oracle query. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP’19), Track A. Schloss Dagstuhl, 96:1--96:13. DOI:https://doi.org/10.4230/LIPIcs.ICALP.2019.96Google Scholar
- Xiaodi Wu, Penghui Yao, and Henry Yuen. 2017. Raz--McKenzie Simulation with the Inner Product Gadget. Technical Report TR17-010. Electronic Colloquium on Computational Complexity (ECCC). Retrieved from https://eccc.weizmann.ac.il/report/2017/010/.Google Scholar
Index Terms
A ZPPNP[1] Lifting Theorem
Recommendations
Algebrization: A New Barrier in Complexity Theory
Any proof of P ≠ NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (e.g., that PP does not have linear-size circuits) that overcome both barriers simultaneously. So the ...
Algebrization: a new barrier in complexity theory
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingAny proof of P!=NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does not have linear-size circuits) that overcome both barriers simultaneously. ...
Query-to-communication lifting for PNP
CCC '17: Proceedings of the 32nd Computational Complexity ConferenceWe 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" ...






Comments