Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of Boolean functions over bases with unbounded fan-in gates
scientific article

    Statements

    Complexity of Boolean functions over bases with unbounded fan-in gates (English)
    0 references
    0 references
    27 February 1997
    0 references
    Boolean functions
    0 references
    Computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers