On the complexity of randomized read-once branching programs (Q3013174)
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 5924796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of randomized read-once branching programs |
scientific article; zbMATH DE number 5924796 |
Statements
18 July 2011
0 references
Boolean function
0 references
binary branching program
0 references
complexity class
0 references
computation complexity lower bound
0 references
0.8921386003494263
0 references
