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

From MaRDI portal
Revision as of 14:25, 16 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
On polynomial-time Turing and many-one completeness in PSPACE
scientific article

    Statements

    title
    On polynomial-time Turing and many-one completeness in PSPACE (English)
    0 references
    author
    Osamu Watanabe
    0 references
    Shouwen Tang
    0 references
    publication date
    27 September 1992
    0 references
    zbMATH DE Number
    65307
    0 references
    zbMATH Keywords
    reducibilities
    0 references
    PSPACE-complete sets
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1193869&oldid=34092552"
    Powered by MediaWiki