Problem
Research questions and friction points this paper is trying to address.
communication complexity
pseudodeterminism
randomized
MA
NP^BPP
Pseudodeterminism and MA != NP^BPP in Communication Complexity
🤖 AI Summary
本文通过改进和简化证明方法，解决了部分布尔函数在零错误随机通信复杂度与伪确定性通信复杂度之间的指数分离问题，并推广该技术以区分MA与NP^BPP的通信复杂度类似物。
📝 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 NP^BPP.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Pseudodeterministic Communication Complexity
Zero-sided-error Randomized
Two-sided-error Pseudodeterministic
Exponential Separation
Partial Boolean Functions
🔎 Similar Papers
No similar papers found.
