An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (Q5326603): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_59 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1022052099 / rank | |||
Normal rank | |||
Latest revision as of 23:56, 19 March 2024
scientific article; zbMATH DE number 6195467
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, |
scientific article; zbMATH DE number 6195467 |
Statements
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (English)
0 references
6 August 2013
0 references
Boolean functions
0 references
randomized computation
0 references
decision tree complexity
0 references
query complexity
0 references
lower bounds
0 references
generalized costs
0 references
