Read-once branching programs for tree evaluation problems (Q2965502)
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 6691420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Read-once branching programs for tree evaluation problems |
scientific article; zbMATH DE number 6691420 |
Statements
3 March 2017
0 references
lower bounds
0 references
branching programs
0 references
read-once branching programs
0 references
space complexity
0 references
combinatorics
0 references
Read-Once Branching Programs for Tree Evaluation Problems. (English)
0 references
0.995298147201538
0 references
0.8727812170982361
0 references
0.8498311638832092
0 references
0.8275798559188843
0 references
0.8138974905014038
0 references
