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

From MaRDI portal
Revision as of 10:56, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the computational complexity of Longley's \(H\) functional
scientific article

    Statements

    title
    On the computational complexity of Longley's \(H\) functional (English)
    0 references
    author
    James S. Royer
    0 references
    publication date
    6 August 2004
    0 references
    zbMATH DE Number
    2083411
    0 references
    zbMATH Keywords
    Sequential computability
    0 references
    Realizability
    0 references
    NP-hardness
    0 references
    Higher-type computational complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1827400&oldid=14194093"
    Powered by MediaWiki