Some results on the computational complexity of symmetric connectionist networks. (Q1353873)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some results on the computational complexity of symmetric connectionist networks. |
scientific article; zbMATH DE number 1005776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some results on the computational complexity of symmetric connectionist networks. |
scientific article; zbMATH DE number 1005776 |
Statements
Some results on the computational complexity of symmetric connectionist networks. (English)
0 references
11 May 1997
0 references
Hopfield networks
0 references
