The optimal read-once branching program complexity for the direct storage access function (Q963361): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2007.11.009 / 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
