A large lower bound on the query complexity of a simple Boolean function (Q1041802)
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 5642376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A large lower bound on the query complexity of a simple Boolean function |
scientific article; zbMATH DE number 5642376 |
Statements
A large lower bound on the query complexity of a simple Boolean function (English)
0 references
4 December 2009
0 references
computational complexity
0 references
branching programs
0 references
property testing
0 references
query complexity
0 references
randomized algorithms
0 references
0 references
0 references
0.8830032348632812
0 references
0.8300611972808838
0 references
0.7758387327194214
0 references
0.7755871415138245
0 references
0.7729049921035767
0 references
