Pages that link to "Item:Q1293360"
From MaRDI portal
The following pages link to Computing Boolean functions by polynomials and threshold circuits (Q1293360):
Displaying 24 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- The expressive power of voting polynomials (Q1330793) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- The hardest halfspace (Q1983325) (← links)
- Asymptotics of the number of 2-threshold functions (Q2051779) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems (Q2487688) (← links)
- Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Threshold circuits detecting global patterns in two-dimensional maps (Q2790159) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- A comparison of the computational power of sigmoid and Boolean threshold circuits (Q4839054) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- (Q5009530) (← links)
- (Q5009555) (← links)
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- New degree bounds for polynomial threshold functions (Q5894427) (← links)