Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705)
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: Randomized vs. deterministic decision tree complexity for read-once Boolean functions |
scientific article; zbMATH DE number 423592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized vs. deterministic decision tree complexity for read-once Boolean functions |
scientific article; zbMATH DE number 423592 |
Statements
Randomized vs. deterministic decision tree complexity for read-once Boolean functions (English)
0 references
10 October 1993
0 references
Boolean decision trees
0 references
randomized complexity
0 references
read-once formulae
0 references
0 references
0.8822559714317322
0 references
0.8068656325340271
0 references
0.8068141937255859
0 references
0.8065241575241089
0 references
0.7743053436279297
0 references
