Quadratically tight relations for randomized query complexity (Q5919457): Difference between revisions
From MaRDI portal
Item:Q5919457
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:13, 2 February 2024
scientific article; zbMATH DE number 7175457
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
