scientific article; zbMATH DE number 7561760
From MaRDI portal
Publication:5092483
DOI10.4230/LIPICS.CCC.2020.32MaRDI QIDQ5092483FDOQ5092483
Authors: Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1909.10428
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum search of spatial regions
- Quantum Complexity Theory
- Algorithmic polynomials
- Every monotone graph property has a sharp threshold
- Lower bounds in communication complexity
- Quantum communication complexity of symmetric predicates
- Title not available (Why is that?)
- Quantum lower bounds by polynomials
- On the computational power of depth-2 circuits with threshold and modulo gates
- Quantum communication and complexity.
- Title not available (Why is that?)
- Robust polynomials and quantum algorithms
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- Unbounded-error quantum query complexity
- On the tightness of the Buhrman-Cleve-Wigderson simulation
- Spectral norm of symmetric functions
- A lifting theorem with applications to symmetric functions
- Improved Bounds on Fourier Entropy and Min-Entropy
- The log-approximate-rank conjecture is false
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092483)
