No. Title Author Year
1 One-Way Communication Complexity and Non-Adaptive Decision Trees Mande, Nikhil S. et al. 2022
2 Symmetry and Quantum Query-To-Communication Simulation Chakraborty, Sourav et al. 2022
3 Tight Chang’s-Lemma-Type Bounds for Boolean Functions Chakraborty, Sourav et al. 2021
4 Improved Approximate Degree Bounds for k-Distinctness Mande, Nikhil S. et al. 2020
5 On Parity Decision Trees for Fourier-Sparse Boolean Functions Mande, Nikhil S. et al. 2020
6 Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead Chakraborty, Sourav et al. 2020
7 Approximate Degree, Secret Sharing, and Concentration Phenomena Bogdanov, Andrej et al. 2019
8 Sign-Rank Can Increase Under Intersection Bun, Mark et al. 2019
9 A Lifting Theorem with Applications to Symmetric Functions Chattopadhyay, Arkadev et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI