We study the equivalence testing problem where the goal is to determine ...
For any Boolean functions f and g, the question whether R(f∘ g) =
Θ̃(R(f...
Given a Boolean formula ϕ over n variables, the problem of model
countin...
Public observation logic (POL) reasons about agent expectations and agen...
Given a data stream 𝒟 = ⟨ a_1, a_2, …, a_m ⟩ of
m elements where each a_...
We introduce and study Certificate Game complexity, a measure of complex...
Let h(d,2) denote the smallest integer such that any finite collection o...
The study of distribution testing has become ubiquitous in the area of
p...
Public observation logic (POL) is a variant of dynamic epistemic logic t...
The framework of distribution testing is currently ubiquitous in the fie...
The role of symmetry in Boolean functions f:{0,1}^n →{0,1} has been
exte...
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean fun...
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result wi...
Given a set of items ℱ and a weight function 𝚠𝚝:
ℱ↦ (0,1), the problem o...
The disjointness problem - where Alice and Bob are given two subsets of ...
Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean
f...
The Fourier-Entropy Influence (FEI) Conjecture states that for any Boole...
We present two new results about exact learning by quantum computers. Fi...
Given a Boolean function f:{-1,1}^n→{-1,1}, the Fourier distribution
ass...
The problem of computing induced subgraphs that satisfy some specified
r...
We study the problem of finding a maximal transitive relation
contained ...