Complexity of monotone networks for Boolean matrix product (Q1218267): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2569195351 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4128424 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:56, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of monotone networks for Boolean matrix product |
scientific article |
Statements
Complexity of monotone networks for Boolean matrix product (English)
0 references
1975
0 references
