Pages that link to "Item:Q5248502"
From MaRDI portal
The following pages link to Bounds for the computational power and learning complexity of analog neural nets (Q5248502):
Displaying 9 items.
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- Neural networks with quadratic VC dimension (Q676433) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions (Q1367525) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- Machines Over the Reals and Non-Uniformity (Q4336697) (← links)
- On digital nondeterminism (Q4717055) (← links)
