Pages that link to "Item:Q1333272"
From MaRDI portal
The following pages link to Approximating threshold circuits by rational functions (Q1333272):
Displaying 5 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)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- On Blocky Ranks Of Matrices (Q6489336) (← links)
