The optimal read-once branching program complexity for the direct storage access function (Q963361): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:22, 30 January 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
