Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138): Difference between revisions

@@ Property / cites work @@
+Superlinear advantage for exact quantum algorithms
+Normal rank
@@ Property / cites work @@
+Separations in Query Complexity Based on Pointer Functions
+Normal rank
@@ Property / cites work @@
+Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$
+Normal rank
@@ Property / cites work @@
+Exact Quantum Query Complexity of EXACT and THRESHOLD
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds by polynomials
@@ Property / cites work: Quantum lower bounds by polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum algorithms revisited
@@ Property / cites work: Quantum algorithms revisited / rank @@
+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 @@
+Polynomials with two values
@@ Property / cites work: Polynomials with two values / rank @@
+Normal rank
@@ Property / cites work @@
+On the sum-of-squares degree of symmetric quadratic functions
+Normal rank
@@ Property / cites work @@
+On exact quantum query complexity
@@ Property / cites work: On exact quantum query complexity / rank @@
+Normal rank