research
∙
09/12/2023
An improved protocol for ExactlyN with more than 3 players
The ExactlyN problem in the number-on-forehead (NOF) communication setti...
share
research
∙
10/15/2022
On depth-3 circuits and covering number: an explicit counter-example
We give a simple construction of n× n Boolean matrices with Ω(n^4/3) zer...
research
∙
11/19/2021
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
We refute the Probabilistic Universal Graph Conjecture of Harms, Wild, a...
research
∙
05/21/2020
Chang's lemma via Pinsker's inequality
Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An en...
research
∙
02/20/2019
