Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583)

From MaRDI portal
Revision as of 09:21, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    28 June 1992
    0 references
    hard combinatorial optimization problems
    0 references
    neural networks
    0 references
    approximate solutions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references