Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:12, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding approximate solutions to NP-hard problems by neural networks is hard |
scientific article |
Statements
Finding approximate solutions to NP-hard problems by neural networks is hard (English)
0 references
28 June 1992
0 references
hard combinatorial optimization problems
0 references
neural networks
0 references
approximate solutions
0 references
