research
∙
07/08/2023
On the Composition of Randomized Query Complexity and Approximate Degree
For any Boolean functions f and g, the question whether R(f∘ g) = Θ̃(R(f...
share
research
∙
06/17/2023
Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?
Given a Boolean formula ϕ over n variables, the problem of model countin...
research
∙
07/25/2022
Testing of Index-Invariant Properties in the Huge Object Model
The study of distribution testing has become ubiquitous in the area of p...
research
∙
12/03/2020
Tight Chang's-lemma-type bounds for Boolean functions
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result wi...
research
∙
09/24/2018
