On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
scientific article

    Statements

    On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (English)
    0 references
    0 references
    5 November 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded-depth circuits
    0 references
    complexity
    0 references
    Boolean cube partitions
    0 references
    0 references
    0 references