On the power of parity polynomial time (Q5750401)

From MaRDI portal
Revision as of 10:20, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4185029
Language Label Description Also known as
English
On the power of parity polynomial time
scientific article; zbMATH DE number 4185029

    Statements

    title
    On the power of parity polynomial time (English)
    0 references
    author
    Jin-Yi Cai
    0 references
    Hemaspaandra, Lane A.
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    computational complexity theory
    0 references
    inclusions and separations of complexity classes
    0 references
    parity polynomial time
    0 references
    NP machines
    0 references
    path-restricted nondeterministic machines
    0 references
    nondeterministic path-restricted languages
    0 references
    cites work
    P-Printable Sets
    0 references
    Near-Testable Sets
    0 references
    Q3779736
    0 references
    Collapsing degrees
    0 references
    Q3815544
    0 references
    Q3703298
    0 references

    Identifiers

    DOI
    10.1007/BF02090768
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    03D15
    0 references
    68Q05
    0 references
    zbMATH DE Number
    4185029
    0 references
    OpenAlex ID
    W1982406523
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5750401&oldid=37260284"
    Powered by MediaWiki