Pages that link to "Item:Q5894427"
From MaRDI portal
The following pages link to New degree bounds for polynomial threshold functions (Q5894427):
Displaying 16 items.
- Decision functions for chain classifiers based on Bayesian networks for multi-label classification (Q895528) (← links)
- The hardest halfspace (Q1983325) (← links)
- On XOR lemmas for the weight of polynomial threshold functions (Q2280318) (← 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)
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
- Fooling Polytopes (Q5066946) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- On neuronal capacity (Q5854113) (← links)
- (Q5875514) (← links)
