Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized vs. deterministic decision tree complexity for read-once Boolean functions |
scientific article |
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
