A lower bound on the number of additions in monotone computations (Q1232179): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of monotone networks for Boolean matrix product / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The network complexity and the Turing machine complexity of finite functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound on the number of additions in monotone computations / rank | |||
Normal rank | |||
Latest revision as of 20:09, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the number of additions in monotone computations |
scientific article |
Statements
A lower bound on the number of additions in monotone computations (English)
0 references
1976
0 references
