A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00486-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026323912 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs |
scientific article |
Statements
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (English)
0 references
23 March 2009
0 references
computational complexity
0 references
read-once branching programs
0 references
nondeterminism
0 references
lower bounds
0 references
depth-restricted circuits
0 references
0 references
0 references
0 references
