Complete problems and strong polynomial reducibilities (Q5096158)

From MaRDI portal
Revision as of 10:10, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7571931
Language Label Description Also known as
English
Complete problems and strong polynomial reducibilities
scientific article; zbMATH DE number 7571931

    Statements

    Complete problems and strong polynomial reducibilities (English)
    0 references
    0 references
    16 August 2022
    0 references
    polynomial time
    0 references
    Turing machine
    0 references
    complexity class
    0 references
    recursion theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references