scientific article; zbMATH DE number 4201618

MaRDI QIDQ3350759zbMATH OpenFDO

Authors Patrik Floréen, Pekka Orponen

Publication date 1989

zbMATH Keywords

computational complexityHopfieldstable states

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1490012
• Some results on the computational complexity of symmetric connectionist networks.
• On the computational power of discrete Hopfield nets
• scientific article; zbMATH DE number 19763
• scientific article; zbMATH DE number 1849152

Cited in

(12)

• Some results on the computational complexity of symmetric connectionist networks.
• An application of Hopfield networks to worst-case power analysis of RT-level VLSI systems
• Predecessor existence problems for finite discrete dynamical systems
• Computational complexity studies of synchronous Boolean finite dynamical systems
• Calculation attractor cycles of length 4 in discrete Hopfield networks
• About non-monotony in Boolean automata networks
• Classification and lumpability in the stochastic Hopfield model
• On the computational power of discrete Hopfield nets
• Neural networks and complexity theory
• Foundations of block-parallel automata networks
• Synchronous dynamical systems on directed acyclic graphs: complexity and algorithms
• Complexity of limit-cycle problems in Boolean 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 Q3350759)