On the computational structure of the connected components of a hard problem (Q1607000)

From MaRDI portal
Revision as of 12:15, 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
On the computational structure of the connected components of a hard problem
scientific article

    Statements

    On the computational structure of the connected components of a hard problem (English)
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    sparse sets
    0 references
    Turing complexity theory
    0 references
    0 references