Quadratically tight relations for randomized query complexity (Q6830264)
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 7175457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quadratically tight relations for randomized query complexity |
scientific article; zbMATH DE number 7175457 |
Statements
Quadratically tight relations for randomized query complexity (English)
0 references
27 February 2020
0 references
query complexity
0 references
randomized algorithms
0 references
certificate complexity
0 references
fractional block sensitivity
0 references
corruption bound
0 references
