Minimal pairs and complete problems (Q1334663)

From MaRDI portal
Revision as of 18:00, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimal pairs and complete problems
scientific article

    Statements

    Minimal pairs and complete problems (English)
    0 references
    0 references
    0 references
    0 references
    25 September 1994
    0 references
    0 references
    minimal pair
    0 references
    polynomial many-one reductions
    0 references
    elementary recursive set
    0 references
    deterministic exponential time
    0 references
    NP-complete sets
    0 references
    oracle dependent
    0 references
    0 references