Pages that link to "Item:Q1333272"
From MaRDI portal
The following pages link to Approximating threshold circuits by rational functions (Q1333272):
Displayed 6 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- A new theorem in threshold logic and its application to multioperand binary adders (Q4467334) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- New degree bounds for polynomial threshold functions (Q5894427) (← links)