scientific article; zbMATH DE number 872005
From MaRDI portal
Publication:4875278
Cited in
(26)- Sequential Triangle Strip Generator Based on Hopfield Networks
- Energy and depth of threshold circuits
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- The computational complexity of understanding binary classifier decisions
- 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
- Computational complexity studies of synchronous Boolean finite dynamical systems
- Hopfield languages
- Parallel machine models: how they are and where are they going
- Computing with truly asynchronous threshold logic networks
- McCulloch-Pitts brains and pseudorandom functions
- On the characterization of weighted simple games
- String Matching: Communication, Circuits, and Learning.
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- A selective overview of deep learning
- Sources of complexity in subset choice
- A better upper bound on weights of exact threshold functions
- Cooperation through social influence
- Circuit lower bounds from learning-theoretic approaches
- Positive neural networks in discrete time implement monotone-regular behaviors
- Size and Energy of Threshold Circuits Computing Mod Functions
- Polynomial‐time universality and limitations of deep learning
- ReLU neural networks of polynomial size for exact maximum flow computation
- Weights of exact threshold functions
- Forms of representation for simple games: sizes, conversions and equivalences
- Analog computation via neural networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875278)
