On the representation of multi-input systems: Computational properties of polynomial algorithms
From MaRDI portal
Cites work
- A logical calculus of the ideas immanent in nervous activity
- A Volterra representation for some neuron models
- A Weierstrass theorem for real, separable Hilbert spaces
- Analog perceptron: Its decomposition and order
- Analog perceptrons: On additive representation of functions
- Computational geometry of linear threshold functions
- Fast Algorithms for Manipulating Formal Power Series
- Finitely convergent learning programs for the separation of sets of shaded figures
- scientific article; zbMATH DE number 3551942 (Why is no real title available?)
- scientific article; zbMATH DE number 3562425 (Why is no real title available?)
- scientific article; zbMATH DE number 3574436 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- scientific article; zbMATH DE number 3388879 (Why is no real title available?)
- Identification and modelling of a class of nonlinear systems
- On optimal nonlinear associative recall
- On representation and approximation of nonlinear systems
- On representation and approximation of nonlinear systems. Part II: Discrete time
- On the analysis of feedback systems with a polynomic plant†
- Polynomial operators in non-linear systems theory
- Stochastic Identification Methods for Nonlinear Systems: An Extension of the Wiener Theory
- Structural features of factorable Volterra systems
- The Volterra Representation and the Wiener Expansion: Validity and Pitfalls
- Towards a theory of local and global in computation
Cited in
(3)
This page was built for publication: On the representation of multi-input systems: Computational properties of polynomial algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154808)