Pages that link to "Item:Q5230298"
From MaRDI portal
The following pages link to The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298):
Displaying 15 items.
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- A quantum evolving secret sharing scheme (Q2024899) (← links)
- Query complexity of generalized Simon's problem (Q2051810) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- (Q5009530) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- (Q5092454) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- (Q5875514) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)
- (Q6176153) (← links)
