Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678)
From MaRDI portal
scientific article; zbMATH DE number 2066226
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs |
scientific article; zbMATH DE number 2066226 |
Statements
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (English)
0 references
18 May 2004
0 references
Computational complexity
0 references
read-once branching programs
0 references
nondeterminism
0 references
lower bounds
0 references
0 references
0 references
0 references
