Asynchronous threshold networks

DOI10.1007/BF02582959zbMath0619.05024MaRDI QIDQ1089351

Noga Alon

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

directed graphssigned graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Complexity of fixed point counting problems in Boolean networks ⋮ Some results on the computational complexity of symmetric connectionist networks. ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Neural networks and complexity theory ⋮ Fixing monotone Boolean networks asynchronously ⋮ Positive and negative cycles in Boolean networks

Cites Work

• On periodical behaviour in societies with symmetric influences
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: Asynchronous threshold networks