A large lower bound on the query complexity of a simple Boolean function (Q1041802): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A large lower bound on the query complexity of a simple Boolean function |
scientific article |
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
