The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q130920938, #quickstatements; #temporary_batch_1731347681068 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3099921078 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1710.09079 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130920938 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:56, 11 November 2024
scientific article; zbMATH DE number 7097005
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The polynomial method strikes back: tight quantum query bounds via dual polynomials |
scientific article; zbMATH DE number 7097005 |
Statements
The polynomial method strikes back: tight quantum query bounds via dual polynomials (English)
0 references
22 August 2019
0 references
polynomial method
0 references
approximate degree
0 references
dual polynomials
0 references
quantum query complexity
0 references
