Pages that link to "Item:Q5140844"
From MaRDI portal
The following pages link to The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844):
Displaying 7 items.
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- The hardest halfspace (Q1983325) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Dual polynomials for collision and element distinctness (Q2830865) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- (Q5158501) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298) (← links)