Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the power of neural networks for solving hard problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Neural networks and physical systems with emergent collective computational abilities. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ``Neural'' computation of decisions in optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Approximate Solutions for Combinatorial Optimization Problems / rank | |||
Normal rank | |||
Revision as of 16:06, 15 May 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
