On the complexity of learning for spiking neurons with temporal coding.
type: Item
instance of: scholarly article
title: On the complexity of learning for spiking neurons with temporal coding.
zbMATH Open document ID: 1045.68598
author: Michael Schmitt
author: Wolfgang Maass
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 92C05
Mathematics Subject Classification ID: 92C20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1853063
zbMATH Keywords: biological neural systems
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: inco.1999.2806
OpenAlex ID: W2064003821
cites work: Q4004178
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Enumeration of Seven-Argument Threshold Functions
cites work: Q4198056
cites work: Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications
cites work: Robust trainability of single neurons
cites work: Learning Boolean formulas
cites work: Toward efficient agnostic learning
cites work: Neural networks with quadratic VC dimension
cites work: Fast Sigmoidal Networks via Spiking Neurons
cites work: Finiteness results for sigmoidal “neural” networks
cites work: Q5655273
cites work: Reduction of the Number of Columns in Flow Table Minimization
cites work: Q4288817
cites work: Introduction to Theoretical Neurobiology
cites work: A theory of the learnable
Wikidata QID: Q114961245
DOI: 10.1006/INCO.1999.2806
description: scientific article; zbMATH DE number 1853063