On query complexity measures and their relations for symmetric functions
From MaRDI portal
Publication:6547823
DOI10.1007/978-3-031-52213-0_5MaRDI QIDQ6547823
Rajat Mittal, Sanjay S. Nair, Sunayana Patro
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of Ambainis lower bounds
- On the degree of Boolean functions as real polynomials
- Complexity measures and decision tree complexity: a survey.
- The quantum query complexity of approximating the median and related statistics
- Properties and applications of boolean function composition
- Quantum Query Complexity of State Conversion
- Quantum lower bounds by quantum arguments
- Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
- Quantum approximate counting, simplified
- Separations between combinatorial measures for transitive functions
This page was built for publication: On query complexity measures and their relations for symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547823)
