Pages that link to "Item:Q488052"
From MaRDI portal
The following pages link to How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052):
Displaying 6 items.
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- (Q5092483) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711559) (← links)