Pages that link to "Item:Q294804"
From MaRDI portal
The following pages link to Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804):
Displaying 6 items.
- On the average sensitivity of the weighted sum function (Q413263) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← links)
- Entropy lower bounds for quantum decision tree complexity (Q1847373) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Improved bounds on quantum learning algorithms (Q2491374) (← links)
