Pages that link to "Item:Q5891428"
From MaRDI portal
The following pages link to Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428):
Displayed 17 items.
- The hardest halfspace (Q1983325) (← links)
- (Q3191588) (← 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)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- (Q4612487) (← 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)
- Fooling Polytopes (Q5066946) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5091179) (← links)
- (Q5092454) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- (Q5093405) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- (Q5919185) (redirect page) (← links)