Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90261-s / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068321983 / rank | |||
Normal rank | |||
Latest revision as of 09:21, 30 July 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
