A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (Q2581005)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications |
scientific article |
Statements
A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (English)
0 references
10 January 2006
0 references
