A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs |
scientific article; zbMATH DE number 5530920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs |
scientific article; zbMATH DE number 5530920 |
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
0.9527235
0 references
0.92047906
0 references
0.8974733
0 references
0.87376946
0 references
0.8664591
0 references
0.8571775
0 references
0.85519135
0 references
0.85516965
0 references
