5 citations · 9 across the 10 of their papers we have counts for
3 papers · 1 filter
Lifting to Parity Decision Trees Via Stifling
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal +1
We show that the deterministic decision tree complexity of a (partial) function or relation lifts to the deterministic parity decision tree (PDT) size complexity of the compose…
Decision Tree Complexity versus Block Sensitivity and Degree
Rahul Chugh, Supartha Podder, Swagato Sanyal
Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known t…
Sampling-Based Winner Prediction in District-Based Elections
Palash Dey, Debajyoti Kar, Swagato Sanyal
In a district-based election, we apply a voting rule to decide the winners in each district, and a candidate who wins in a maximum number of districts is the winner of the elec…