On the computational complexity of Longley's \(H\) functional (Q1827400)

From MaRDI portal
Revision as of 04:14, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of Longley's \(H\) functional
scientific article

    Statements

    On the computational complexity of Longley's \(H\) functional (English)
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Sequential computability
    0 references
    Realizability
    0 references
    NP-hardness
    0 references
    Higher-type computational complexity
    0 references