Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:56, 4 March 2024
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
