The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging (Q3856097): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:02, 5 March 2024
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
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
