Pages that link to "Item:Q4839054"
From MaRDI portal
The following pages link to A comparison of the computational power of sigmoid and Boolean threshold circuits (Q4839054):
Displaying 5 items.
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Turing computability with neural nets (Q1190653) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)