The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging (Q3856097)

From MaRDI portal
Revision as of 23:31, 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
The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
scientific article

    Statements

    The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging (English)
    0 references
    0 references
    1979
    0 references
    combinational complexity
    0 references
    combinational switching networks
    0 references
    synthesize monotone Boolean functions
    0 references
    lower bounds on the size of monotone switching circuits for certain bilinear forms
    0 references
    Toeplitz and circulant matrix-vector products
    0 references
    Boolean convolution
    0 references
    routing networks
    0 references
    cyclic and logical shifting
    0 references
    merging
    0 references
    monotone switching networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references