The following pages link to On small depth threshold circuits (Q5056127):
Displaying 10 items.
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (Q1802063) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
