Seguir
Nikhil Mande
Nikhil Mande
Lecturer, University of Liverpool
E-mail confirmado em liverpool.ac.uk - Página inicial
Título
Citado por
Citado por
Ano
The log-approximate-rank conjecture is false
A Chattopadhyay, NS Mande, S Sherif
Journal of the ACM (JACM) 67 (4), 1-28, 2020
422020
A short list of equalities induces large sign-rank
A Chattopadhyay, NS Mande
SIAM Journal on Computing 51 (3), 820-848, 2022
26*2022
Improved approximate degree bounds for k-distinctness
NS Mande, J Thaler, S Zhu
TQC 2020, 2020
122020
On parity decision trees for fourier-sparse boolean functions
NS Mande, S Sanyal
FSTTCS 2020, 2020
9*2020
Lower bounds for linear decision lists
A Chattopadhyay, M Mahajan, N Mande, N Saurabh
CJTCS 2020, 2019
92019
Tight Bounds for Quantum Phase Estimation and Related Problems
NS Mande, R de Wolf
ESA 2023, 2023
72023
Separation of unbounded-error models in multi-party communication complexity
A Chattopadhyay, NS Mande
Theory of Computing 14 (1), 1-23, 2018
7*2018
Lifting to Parity Decision Trees via Stifling
A Chattopadhyay, NS Mande, S Sanyal, S Sherif
ITCS 2023, 2022
62022
Quantum query-to-communication simulation needs a logarithmic overhead
S Chakraborty, A Chattopadhyay, NS Mande, M Paraashar
CCC 2020, 2019
62019
Approximate degree, secret sharing, and concentration phenomena
A Bogdanov, NS Mande, J Thaler, C Williamson
APPROX-RANDOM 2019, 2019
62019
Dual polynomials and communication complexity of functions
A Chattopadhyay, NS Mande
arXiv preprint arXiv:1704.02537, 2017
62017
A lifting theorem with applications to symmetric functions
A Chattopadhyay, NS Mande
FSTTCS 2017, 2018
52018
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
A Cornelissen, NS Mande, S Patro
FSTTCS 2022, 2022
42022
Symmetry and quantum query-to-communication simulation
S Chakraborty, A Chattopadhyay, P Høyer, NS Mande, M Paraashar, ...
STACS 2022, 2022
42022
Tight chang’s-lemma-type bounds for boolean functions
S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal
FSTTCS 2021, 2021
42021
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
A Cornelissen, NS Mande, M Ozols, R de Wolf
arXiv preprint arXiv:2112.14682, 2021
32021
Sign-rank can increase under intersection
M Bun, NS Mande, J Thaler
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-17, 2021
32021
Randomized versus deterministic decision tree size
A Chattopadhyay, Y Dahiya, NS Mande, J Radhakrishnan, S Sanyal
STOC 2023, 867-880, 2023
22023
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error
O Lalonde, NS Mande, R de Wolf
FSTTCS 2023, 2021
22021
Quantum Sabotage Complexity
A Cornelissen, NS Mande, S Patro
arXiv preprint arXiv:2408.12595, 2024
12024
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20