Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
scientific article

    Statements

    Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (English)
    0 references
    0 references
    5 June 2008
    0 references
    Boolean function
    0 references
    circuit
    0 references
    complexity
    0 references
    depth
    0 references
    lower bound
    0 references
    cyclic convolution
    0 references

    Identifiers