Pages that link to "Item:Q2347795"
From MaRDI portal
The following pages link to Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795):
Displaying 19 items.
- Weighted Sobolev spaces: Markov-type inequalities and duality (Q1656838) (← links)
- On separation between the degree of a Boolean function and the block sensitivity (Q2117108) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← 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)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Lupaş-type inequality and applications to Markov-type inequalities in weighted Sobolev spaces (Q4993931) (← links)
- (Q5009530) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5092454) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- A Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- (Q5326570) (redirect page) (← links)
- (Q5875514) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)
