A lower bound for randomized algebraic decision trees (Q1386178)
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: A lower bound for randomized algebraic decision trees |
scientific article; zbMATH DE number 1151786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for randomized algebraic decision trees |
scientific article; zbMATH DE number 1151786 |
Statements
A lower bound for randomized algebraic decision trees (English)
0 references
13 May 1998
0 references
randomized algebraic decision trees
0 references
knapsack problem
0 references
element distinctness problem
0 references
0 references
0 references
0 references
0.8462250232696533
0 references
0.8299562335014343
0 references
