Approximate degree lower bounds for oracle identification problems (Q6640409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate degree lower bounds for oracle identification problems |
scientific article; zbMATH DE number 7946430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate degree lower bounds for oracle identification problems |
scientific article; zbMATH DE number 7946430 |
Statements
Approximate degree lower bounds for oracle identification problems (English)
0 references
20 November 2024
0 references
approximate degree
0 references
quantum query complexity
0 references
communication complexity
0 references
ordered search
0 references
polynomial approximations
0 references
polynomial method
0 references
