Some results on the computational complexity of symmetric connectionist networks.

DOI10.1007/BF01530937zbMath1034.68522MaRDI QIDQ1353873

O. Diekmann

Publication date: 11 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Hopfield networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Related Items (2)

Some results on the computational complexity of symmetric connectionist networks. ⋮ Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge

Cites Work

• Asynchronous threshold networks
• Some results on the computational complexity of symmetric connectionist networks.
• Neural networks and physical systems with emergent collective computational abilities.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some results on the computational complexity of symmetric connectionist networks.