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 |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| 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 | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/9904107 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sensitivity vs. block sensitivity (an average-case study) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Influence of Single Participant in Coin Flipping Schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rapid solution of problems by quantum computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4228473 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the degree of Boolean functions as real polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4939146 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sensitivity vs. block sensitivity of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Power of Quantum Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pseudo-average block sensitivity equals average sensitivity / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024588775 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:22, 30 July 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
