Strong and weak reducibility of algorithmic problems1 (Q2799750)

From MaRDI portal
Revision as of 18:23, 16 August 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
Strong and weak reducibility of algorithmic problems1
scientific article

    Statements

    Strong and weak reducibility of algorithmic problems1 (English)
    0 references
    0 references
    0 references
    13 April 2016
    0 references
    0 references
    M-problems
    0 references
    ex-problems
    0 references
    weak reducibility
    0 references
    weak degrees
    0 references