All superlinear inverse schemes are coNP-hard (Q2575753)

From MaRDI portal
Revision as of 08:12, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
All superlinear inverse schemes are coNP-hard
scientific article

    Statements

    title
    All superlinear inverse schemes are coNP-hard (English)
    0 references
    author
    Edith Hemaspaandra
    0 references
    Harald Hempel
    0 references
    Hemaspaandra, Lane A.
    0 references
    publication date
    6 December 2005
    0 references
    zbMATH Keywords
    Inverse problems
    0 references
    Certificates
    0 references
    coNP-hardness
    0 references
    NP
    0 references
    P-producible sets
    0 references
    Complexity theory
    0 references

    Identifiers

    zbMATH DE Number
    2235836
    0 references
    OpenAlex ID
    W2005128655
    0 references
    arXiv ID
    cs/0410023
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2575753&oldid=39153294"
    Powered by MediaWiki