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/13/2023
Improving Zero-Shot Detection of Low Prevalence Chest Pathologies using Domain Pre-trained Language Models
Recent advances in zero-shot learning have enabled the use of paired ima...
research
∙
11/07/2022
Certificate games
We introduce and study Certificate Game complexity, a measure of complex...
research
∙
04/07/2022
A Joint Learning Approach for Semi-supervised Neural Topic Modeling
Topic models are some of the most popular ways to represent textual data...
research
∙
10/25/2021
Lower bounds on quantum query complexity for symmetric functions
One of the main reasons for query model's prominence in quantum complexi...
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
∙
11/22/2020
On algorithms to find p-ordering
The concept of p-ordering for a prime p was introduced by Manjul Bhargav...
research
∙
02/20/2019
Counting basic-irreducible factors mod p^k in deterministic poly-time and p-adic applications
Finding an irreducible factor, of a polynomial f(x) modulo a prime p, is...
research
∙
01/20/2019
