scientific article; zbMATH DE number 4155875
From MaRDI portal
Publication:3484350
Recommendations
Cited in
(27)- On recurrent and recursive interconnection patterns
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
- Parallel computation with threshold functions
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
- Upper envelope onion peeling
- Computing with discrete multi-valued neurons
- Computing with truly asynchronous threshold logic networks
- Analog computation via neural networks
- Learning with discrete multivalued neurons
- Reserve prices in repeated auctions
- Efficient threshold circuits for power series
- Endogenous budget constraints
- Complexity and neural networks
- On the complexity of computing and learning with multiplicative neural networks
- On the complexity of recognizing a set of vectors by a neuron
- scientific article; zbMATH DE number 17222 (Why is no real title available?)
- scientific article; zbMATH DE number 19778 (Why is no real title available?)
- scientific article; zbMATH DE number 67614 (Why is no real title available?)
- scientific article; zbMATH DE number 1200326 (Why is no real title available?)
- On the computational power of discrete Hopfield nets
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- scientific article; zbMATH DE number 2109861 (Why is no real title available?)
- Neural networks and complexity theory
- Reachability in Simple Neural Networks
- An efficient algorithm for the Knight's tour problem
- Cayley automata
- The parallel complexity of two problems on concurrency
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 Q3484350)
