research
∙
11/04/2019
Bare quantum simultaneity versus classical interactivity in communication complexity
A relational bipartite communication problem is presented that has an ef...
share
research
∙
07/08/2019
Santha-Vazirani sources, deterministic condensers and very strong extractors
The notion of semi-random sources, also known as Santha-Vazirani (SV) so...
research
∙
11/27/2018
A composition theorem for randomized query complexity via max conflict complexity
Let R_ϵ(·) stand for the bounded-error randomized query complexity with ...
research
∙
01/07/2018
On the randomised query complexity of composition
Let f⊆{0,1}^n×Ξ be a relation and g:{0,1}^m→{0,1,*} be a promise functio...
research
∙
08/02/2017