Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal direct sum results for deterministic and randomized decision tree complexity |
scientific article; zbMATH DE number 6018497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal direct sum results for deterministic and randomized decision tree complexity |
scientific article; zbMATH DE number 6018497 |
Statements
Optimal direct sum results for deterministic and randomized decision tree complexity (English)
0 references
27 March 2012
0 references
computational complexity
0 references
direct sum
0 references
decision tree complexity
0 references
0 references
0 references
0.8180316090583801
0 references
0.7938451766967773
0 references
0.7678757905960083
0 references
0.766506552696228
0 references
