Showing 1–20 of 36 results
/ Date/ Name
May 19, 2019Broadcast Congested Clique: Planted Cliques and Pseudorandom GeneratorsMay 27, 2016Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy ConjectureMay 23, 2016Pure Exploration of Multi-armed Bandit Under Matroid ConstraintsMay 27, 2018Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold CircuitsNov 12, 2015On the Optimal Sample Complexity for Best Arm IdentificationSep 21, 2020On Distributed Differential Privacy and Counting Distinct ElementsMay 7, 2018Fine-grained Complexity Meets IP = PSPACEFeb 7, 2018On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner ProductDec 18, 2016Complexity-Theoretic Foundations of Quantum Supremacy ExperimentsNov 19, 2018Classical Algorithms from Quantum and Arthur-Merlin Communication ProtocolsSep 22, 2022Making Quantum Local Verifiers Simulable with Potential Applications to Zero-KnowledgeJul 17, 2016An Improved Algorithm for Incremental DFS Tree in Undirected GraphsMay 2, 2016A Note on Oracle Separations for BQPJun 13, 2016Adaptivity vs PostselectionDec 28, 2021Quantum Merkle TreesNov 29, 2018An Equivalence Class for Orthogonal VectorsFeb 22, 2021Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed GraphsNov 2, 2021Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash FunctionsAug 22, 2016Towards Instance Optimal Bounds for Best Arm IdentificationSep 9, 2016On the Power of Statistical Zero Knowledge