The optimal read-once branching program complexity for the direct storage access function (Q963361): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080585858 / rank | |||
Normal rank | |||
Revision as of 23:16, 19 March 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
