The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging (Q3856097)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging |
scientific article; zbMATH DE number 3657123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging |
scientific article; zbMATH DE number 3657123 |
Statements
The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging (English)
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
