activity
20162026
most citedWhen Is Amplification Necessary for Composition in Randomized Query Complexity?

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.CC2026

Pseudodeterminism and MA != NP^BPP in Communication Complexity

Thomas Watson

We prove an exponential separation between zero-sided-error randomized and two-sided-error pseudodeterministic communication complexities of partial boolean functions. This qualita…