The following pages link to Approximating the AND-OR tree (Q3191590):
Displaying 11 items.
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Finding optimal satisficing strategies for and-or trees (Q2457646) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- (Q5009530) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- A Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)