A complexity theory based on Boolean algebra (Q3771612)

From MaRDI portal
Revision as of 00:09, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A complexity theory based on Boolean algebra
scientific article

    Statements

    A complexity theory based on Boolean algebra (English)
    0 references
    1985
    0 references
    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

    0 references
    0 references
    0 references
    0 references
    0 references