The optimal read-once branching program complexity for the direct storage access function (Q963361): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2007.11.009 / rank | |||
| Property / cites work | |||
| Property / cites work: Exact OBDD bounds for some fundamental functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3762226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branching Programs and Binary Decision Diagrams / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2007.11.009 / rank | |||
Normal rank | |||
Latest revision as of 10:12, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The optimal read-once branching program complexity for the direct storage access function |
scientific article |
Statements
The optimal read-once branching program complexity for the direct storage access function (English)
0 references
19 April 2010
0 references
computational complexity
0 references
lower bounds
0 references
read-once branching programs
0 references
0 references
0 references
