Swagato Sanyal | DeepAI

DeepAI AI Chat

Featured Co-authors

Rahul Jain
52 publications
Palash Dey
30 publications
Sourav Chakraborty
21 publications
Nikhil S. Mande
14 publications
Miklos Santha
13 publications
Troy Lee
13 publications
Nitin Saurabh
11 publications
Manaswi Paraashar
10 publications
Rajat Mittal
9 publications
Arkadev Chattopadhyay
8 publications
Jevgēnijs Vihrovs
8 publications

∙ 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...

0 Sourav Chakraborty, et al. ∙

∙ 11/30/2022

Lifting to Parity Decision Trees Via Stifling

We show that the deterministic decision tree complexity of a (partial) f...

0 Arkadev Chattopadhyay, et al. ∙

∙ 09/16/2022

Decision Tree Complexity versus Block Sensitivity and Degree

Relations between the decision tree complexity and various other complex...

0 Rahul Chugh, et al. ∙

∙ 02/28/2022

Sampling-Based Winner Prediction in District-Based Elections

In a district-based election, we apply a voting rule r to decide the win...

0 Palash Dey, et al. ∙

∙ 05/05/2021

One-way communication complexity and non-adaptive decision trees

We study the relationship between various one-way communication complexi...

0 Nikhil S. Mande, et al. ∙

∙ 12/03/2020

Tight Chang's-lemma-type bounds for Boolean functions

Chang's lemma (Duke Mathematical Journal, 2002) is a classical result wi...

0 Sourav Chakraborty, et al. ∙

∙ 08/01/2020

On parity decision trees for Fourier-sparse Boolean functions

We study parity decision trees for Boolean functions. The motivation of ...

0 Nikhil S. Mande, et al. ∙

∙ 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 ...

0 Dmitry Gavinsky, et al. ∙

∙ 01/10/2018

A Composition Theorem via Conflict Complexity

Let (·) stand for the bounded-error randomized query complexity. We show...

0 Swagato Sanyal, et al. ∙

∙ 08/02/2017

Quadratically Tight Relations for Randomized Query Complexity

Let f:{0,1}^n →{0,1} be a Boolean function. The certificate complexity C...

0 Dmitry Gavinsky, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world