On polynomial-time Turing and many-one completeness in PSPACE (Q1193869)

From MaRDI portal
Revision as of 03:29, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On polynomial-time Turing and many-one completeness in PSPACE
scientific article

    Statements

    On polynomial-time Turing and many-one completeness in PSPACE (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    reducibilities
    0 references
    PSPACE-complete sets
    0 references