Pseudodeterminism and MA != NPBPP in Communication Complexity
Thomas Watson
Abstract
We prove an exponential separation between zero-sided-error randomized and two-sided-error pseudodeterministic communication complexities of partial boolean functions. This qualitatively improves and simplifies the proof of the separation by Göös, Harms, Riazanov, Sofronova, Sokolov, and Yuan (STOC 2026), which had a two-sided-error randomized upper bound. Then, we generalize our technique to separate the communication complexity analogues of MA and NPBPP.
Create a lesson
Related papers
Group Isomorphism and the Polylogarithmic-Time Hierarchy: Depth-212 Circuits and Lower Bounds
Joshua A. Grochow, Gülce Kardeş, Michael Levet
Continuous Computational Social Choice: A Case Study in Bribery
Martin Koutecký, Nikolaos Melissinos, Tung Anh Vu et al.
Pseudorandom Functions in NC1 from LWE/LPN/CDH (Or: How to Build PRFs in NC1, Generically)
Youlong Ding, Aayush Jain, Ilan Komargodski
Parameterized Complexity of Lp-Lipschitz Constants for Input Convex Neural Networks and Lp-Norm Maximization over Zonotopes
Aritra Das, Vincent Froese, Moritz Grillo et al.
Exact CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan
Step Recursion: Resource Profiles and Descent Quotients
Kirill Osipov