Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+quant-ph/9904107
@@ Property / arXiv ID: quant-ph/9904107 / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity vs. block sensitivity (an average-case study)
+Normal rank
@@ Property / cites work @@
+On the Influence of Single Participant in Coin Flipping Schemes
+Normal rank
@@ Property / cites work @@
+Rapid solution of problems by quantum computation
@@ Property / cites work: Rapid solution of problems by quantum computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+Q4939146
@@ Property / cites work: Q4939146 / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity vs. block sensitivity of Boolean functions
+Normal rank
@@ Property / cites work @@
+On the Power of Quantum Computation
@@ Property / cites work: On the Power of Quantum Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudo-average block sensitivity equals average sensitivity
+Normal rank
@@ Property / OpenAlex ID @@
+W2024588775
@@ Property / OpenAlex ID: W2024588775 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:294804