A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (Q4708564)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1929932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications |
scientific article; zbMATH DE number 1929932 |
Statements
18 June 2003
0 references
0.997336745262146
0 references
0.863132119178772
0 references
0.8609291911125183
0 references
0.8579896688461304
0 references
0.8460037112236023
0 references
A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (English)
0 references
