Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01212962 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134298805 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 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
0 references
