scientific article; zbMATH DE number 872005
From MaRDI portal
zbMath0864.68082MaRDI QIDQ4875278
Publication date: 28 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Weights of exact threshold functions, Analog computation via neural networks, Cooperation through social influence, Circuit lower bounds from learning-theoretic approaches, Size and Energy of Threshold Circuits Computing Mod Functions, Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs, Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems, Polynomial‐time universality and limitations of deep learning, ReLU neural networks of polynomial size for exact maximum flow computation, Energy and depth of threshold circuits, Forms of representation for simple games: sizes, conversions and equivalences, Size-energy tradeoffs for unate circuits computing symmetric Boolean functions, On the characterization of weighted simple games, Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors, McCulloch-Pitts Brains and Pseudorandom Functions, String Matching: Communication, Circuits, and Learning., A Better Upper Bound on Weights of Exact Threshold Functions, Size, Depth and Energy of Threshold Circuits Computing Parity Function., Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity, Sources of complexity in subset choice, Sequential Triangle Strip Generator Based on Hopfield Networks, A selective overview of deep learning, Computing with truly asynchronous threshold logic networks, The Computational Complexity of Understanding Binary Classifier Decisions
