"Lower Bounds on the Complexity of Approximating Continuous Functions by ..."

Michael Schmitt (1999)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-06

- view
  - electronic edition @ nips.cc (open access)
  - electronic edition @ djvuzone.org (archived)
- export record
  dblp key:
  - conf/nips/Schmitt99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/Schmitt99
Michael Schmitt:
Lower Bounds on the Complexity of Approximating Continuous Functions by Sigmoidal Neural Networks. NIPS 1999: 328-334

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.