Nikhil S. Mande

activity

20172026

most citedTight Bounds for Quantum Phase Estimation and Related Problems

6 citations · 24 across the 17 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.CC2017★ 5 cited

Weights at the Bottom Matter When the Top is Heavy

Arkadev Chattopadhyay, Nikhil S. Mande

Proving super-polynomial lower bounds against depth-2 threshold circuits of the form THR of THR is a well-known open problem that represents a frontier of our understanding in bool…

cs.CC2017

Dual polynomials and communication complexity of $XOR$ functions

Arkadev Chattopadhyay, Nikhil S. Mande

We show a new duality between the polynomial margin complexity of $f$ and the discrepancy of the function $f \circ XOR$ , called an $XOR$ function. Using this dual…

Weights at the Bottom Matter When the Top is Heavy

Dual polynomials and communication complexity of XOR functions

Dual polynomials and communication complexity of $XOR$ functions