Swagato Sanyal

activity

20092026

most citedOn Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids

16 citations · 26 across the 13 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.CC2018

A composition theorem for randomized query complexity via max conflict complexity

Dmitry Gavinsky, Troy Lee, Miklos Santha +1

Let $R_{ε} (\cdot)$ stand for the bounded-error randomized query complexity with error $ε > 0$ . For any relation $f \subseteq {0, 1}^{n} \times S$ and partial Boolean function $g \subse…

cs.CC2018★ 5 cited

A Composition Theorem via Conflict Complexity

Swagato Sanyal

Let $R (\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq {0, 1}^{n} \times S$ and partial Boolean function $g \s…