On the representation of multi-input systems: Computational properties of polynomial algorithms
DOI10.1007/BF00355455zbMath0465.68032OpenAlexW2048024397WikidataQ52767528 ScholiaQ52767528MaRDI QIDQ1154808
Publication date: 1980
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00355455
parallel algorithmsTaylor serieskernelsinput-output mapsystem structurepolynomial mappingsarray of photoreceptorspolynomial approximation of systems
Formal languages and automata (68Q45) Circuits, networks (94C99) General systems theory (93A99) Algorithms in computer science (68W99) Physiological, cellular and medical topics (92Cxx)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On representation and approximation of nonlinear systems. Part II: Discrete time
- On optimal nonlinear associative recall
- Finitely convergent learning programs for the separation of sets of shaded figures
- Towards a theory of local and global in computation
- On representation and approximation of nonlinear systems
- A Volterra representation for some neuron models
- Identification and modelling of a class of nonlinear systems
- A Weierstrass theorem for real, separable Hilbert spaces
- On the analysis of feedback systems with a polynomic plant†
- Analog perceptron: Its decomposition and order
- Structural features of factorable Volterra systems
- Computational geometry of linear threshold functions
- The Volterra Representation and the Wiener Expansion: Validity and Pitfalls
- Stochastic Identification Methods for Nonlinear Systems: An Extension of the Wiener Theory
- Fast Algorithms for Manipulating Formal Power Series
- Polynomial operators in non-linear systems theory
- Analog perceptrons: On additive representation of functions
- A logical calculus of the ideas immanent in nervous activity
This page was built for publication: On the representation of multi-input systems: Computational properties of polynomial algorithms