Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q12 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6594117 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
quantum computation | |||
| Property / zbMATH Keywords: quantum computation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Boolean functions | |||
| Property / zbMATH Keywords: Boolean functions / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sensitivity | |||
| Property / zbMATH Keywords: sensitivity / rank | |||
Normal rank | |||
Revision as of 20:36, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables |
scientific article |
Statements
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (English)
0 references
16 June 2016
0 references
computational complexity
0 references
quantum computation
0 references
Boolean functions
0 references
sensitivity
0 references
