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

From MaRDI portal
Revision as of 01:22, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





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
    5 November 2019
    0 references
    bounded-depth circuits
    0 references
    complexity
    0 references
    Boolean cube partitions
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references