Nikhil S. Mande

发表

Symmetry and Quantum Query-to-Communication Simulation pdf

Ronald de Wolf, Peter Hoyer, Sourav Chakraborty, 2020, STACS.

On parity decision trees for Fourier-sparse Boolean functions pdf

Nikhil S. Mande, Swagato Sanyal, 2020, Electron. Colloquium Comput. Complex..

Improved Approximate Degree Bounds For k-distinctness

Nikhil S. Mande, Justin Thaler, Shuchen Zhu, 2020, Electron. Colloquium Comput. Complex..

Dual polynomials and communication complexity of XOR functions

Arkadev Chattopadhyay, Nikhil S. Mande, 2017, Electron. Colloquium Comput. Complex..

Sign-Rank Can Increase Under Intersection

Nikhil S. Mande, Justin Thaler, Mark Bun, 2019, Electron. Colloquium Comput. Complex..

Separation of Unbounded-Error Models in Multi-Party Communication Complexity

Arkadev Chattopadhyay, Nikhil S. Mande, 2018, Theory Comput..

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

Sourav Chakraborty, Nikhil S. Mande, Manaswi Paraashar, 2020, ArXiv.

A Short List of Equalities Induces Large Sign Rank

Arkadev Chattopadhyay, Nikhil S. Mande, A. Chattopadhyay, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Quantum query-to-communication simulation needs a logarithmic overhead

Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, 2019, Electron. Colloquium Comput. Complex..

Dual polynomials and communication complexity of $\textsf{XOR}$ functions

Arkadev Chattopadhyay, Nikhil S. Mande, 2017 .

Weights at the Bottom Matter When the Top is Heavy

Arkadev Chattopadhyay, Nikhil S. Mande, A. Chattopadhyay, 2017, Electron. Colloquium Comput. Complex..

The log-approximate-rank conjecture is false

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif, 2018, Electron. Colloquium Comput. Complex..

Approximate degree, secret sharing, and concentration phenomena

Nikhil S. Mande, Justin Thaler, Andrej Bogdanov, 2019, Electron. Colloquium Comput. Complex..

The Log-Approximate-Rank Conjecture Is False

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif, 2020, J. ACM.

Lower Bounds for Linear Decision Lists

Meena Mahajan, Arkadev Chattopadhyay, Nikhil S. Mande, 2019, Electron. Colloquium Comput. Complex..

Small Error Versus Unbounded Error Protocols in the NOF Model

Arkadev Chattopadhyay, Nikhil S. Mande, 2016, Electron. Colloquium Comput. Complex..

A Lifting Theorem with Applications to Symmetric Functions

Arkadev Chattopadhyay, Nikhil S. Mande, 2017, FSTTCS.

Exact quantum query complexity of computing Hamming weight modulo powers of two and three pdf

Maris Ozols, Ronald de Wolf, Nikhil S. Mande, 2021, ArXiv.

Sign-rank Can Increase under Intersection

Nikhil S. Mande, Justin Thaler, Mark Bun, 2019, Electron. Colloquium Comput. Complex..

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

Sourav Chakraborty, Nikhil S. Mande, Manaswi Paraashar, 2020, FSTTCS.

One-way communication complexity and non-adaptive decision trees pdf

Nikhil S. Mande, Swagato Sanyal, Swagato Sanyal, 2021, Electron. Colloquium Comput. Complex..

Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error

Ronald de Wolf, Nikhil S. Mande, 2021, Electron. Colloquium Comput. Complex..

Improved Approximate Degree Bounds For k-distinctness

Nikhil S. Mande, J. Thaler, Shuchen Zhu, 2020, Electron. Colloquium Comput. Complex..

The Log-Approximate-Rank Conjecture Is False

Nikhil S. Mande, A. Chattopadhyay, Suhail Sherif, 2020, J. ACM.

Tight Bounds for Quantum Phase Estimation and Related Problems

Nikhil S. Mande, R. D. Wolf, 2023, ESA.

The Role of Symmetry in Quantum Query-to-Communication Simulation

Nikhil S. Mande, R. D. Wolf, P. Høyer, 2020, 2012.05233.