Pages that link to "Item:Q2906797"

The following pages link to The quantum query complexity of \(\mathrm{AC}^0\) (Q2906797):

Displaying 15 items.

• Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
• Quantum complexity of the approximation for the classes \({\mathcal B}(W^r_p([0,1]^d))\) and \({\mathcal B}(H^r_p([0,1]^d))\) (Q716524) (← links)
• A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
• The power of various real-valued quantum queries (Q1888377) (← links)
• Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
• The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
• Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
• Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
• A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
• Algorithmic Polynomials (Q5138783) (← links)
• The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
• (Q5158501) (← links)
• Algorithms and Computation (Q5191645) (← links)
• (Q5875514) (← links)
• (Q6176153) (← links)