Nikhil S. Mande

From MaRDI portal
(Redirected from Person:4612485)
Nikhil S. Mande Q4612485



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tight bounds for quantum phase estimation and related problems2025-01-06Paper
Lifting to parity decision trees via stifling2024-09-25Paper
Improved quantum query upper bounds based on classical decision trees2024-09-12Paper
Randomized versus deterministic decision tree size2024-05-08Paper
Symmetry and quantum query-to-communication simulation2024-04-23Paper
One-way communication complexity and non-adaptive decision trees2024-04-23Paper
scientific article; zbMATH DE number 7799588 (Why is no real title available?)
(available as arXiv preprint)
2024-02-05Paper
scientific article; zbMATH DE number 7651029 (Why is no real title available?)
(available as arXiv preprint)
2023-02-07Paper
Approximate Degree, Secret Sharing, and Concentration Phenomena
(available as arXiv preprint)
2023-02-03Paper
Sign-rank can increase under intersection2022-07-21Paper
scientific article; zbMATH DE number 7561760 (Why is no real title available?)
(available as arXiv preprint)
2022-07-21Paper
A short list of equalities induces large sign-rank
SIAM Journal on Computing
2022-07-08Paper
Sign-rank can increase under intersection
ACM Transactions on Computation Theory
2022-03-29Paper
Sign-rank can increase under intersection
ACM Transactions on Computation Theory
2022-03-29Paper
Lower bounds for linear decision lists
Chicago Journal of Theoretical Computer Science
2021-05-14Paper
A lifting theorem with applications to symmetric functions2020-11-25Paper
The Log-Approximate-Rank Conjecture Is False
Journal of the ACM
2020-11-11Paper
The log-approximate-rank conjecture is false
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
2020-01-30Paper
Separation of unbounded-error models in multi-party communication complexity
Theory of Computing
2019-01-31Paper


Research outcomes over time


This page was built for person: Nikhil S. Mande