The complexity of problems on probabilistic, nondeterministic, and alternating decision trees (Q3768402)
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 4026830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of problems on probabilistic, nondeterministic, and alternating decision trees |
scientific article; zbMATH DE number 4026830 |
Statements
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees (English)
0 references
1985
0 references
decision trees
0 references
lower bounds
0 references
Monte Carlo algorithms
0 references
alternating Turing machine
0 references
0.815575361251831
0 references
0.7832710146903992
0 references
0.779752790927887
0 references
0.7628458142280579
0 references
