18 citations · 18 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Randomised Composition and Small-Bias Minimax
Shalev Ben-David, Eric Blais, Mika Göös +1
We prove two results about randomised query complexity . First, we introduce a "linearised" complexity measure and show that it satisfies an inner-opti…
cs.CC2022
Communication Complexity of Collision
Mika Göös, Siddhartha Jain
The Collision problem is to decide whether a given list of numbers is -to- or -to- when promised one of them is the case. We show an $n^{Ω(1)…