A complexity theory based on Boolean algebra (Q3771612)

From MaRDI portal
Revision as of 12:28, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A complexity theory based on Boolean algebra
scientific article

    Statements

    title
    A complexity theory based on Boolean algebra (English)
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    circuit complexity
    0 references
    complexity classes
    0 references
    NP-completeness
    0 references
    Boolean function
    0 references
    projection
    0 references
    Turing-machine
    0 references
    complexity theory
    0 references

    Identifiers

    DOI
    10.1145/3149.3158
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    03D15
    0 references
    94C10
    0 references
    zbMATH DE Number
    4030977
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3771612&oldid=17315875"
    Powered by MediaWiki