Unbounded-error quantum query complexity (Q638526): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.04.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2964304770
@@ Property / OpenAlex ID: W2964304770 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002757
@@ Property / cites work: Q3002757 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2798999
@@ Property / cites work: Q2798999 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on quantum black-box complexity of almost all Boolean functions
+Normal rank
@@ Property / cites work @@
+The expressive power of voting polynomials
@@ Property / cites work: The expressive power of voting polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds by polynomials
@@ Property / cites work: Quantum lower bounds by polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Perceptrons, PP, and the polynomial hierarchy
@@ Property / cites work: Perceptrons, PP, and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Complexity Theory
@@ Property / cites work: Quantum Complexity Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542521
@@ Property / cites work: Q4542521 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
+Normal rank
@@ Property / cites work @@
+A linear lower bound on the unbounded error probabilistic communication complexity.
+Normal rank
@@ Property / cites work @@
+Relations between communication complexity classes
+Normal rank
@@ Property / cites work @@
+Q4736848
@@ Property / cites work: Q4736848 / rank @@
+Normal rank
@@ Property / cites work @@
+Unbounded-Error One-Way Classical and Quantum Communication Complexity
+Normal rank
@@ Property / cites work @@
+Unbounded-Error Classical and Quantum Communication Complexity
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Quantum Communication Complexity
@@ Property / cites work: Lower Bounds for Quantum Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Weakly Nondeterministic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q3996586
@@ Property / cites work: Q3996586 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+Extremal properties of polynomial threshold functions
+Normal rank
@@ Property / cites work @@
+Probabilistic communication complexity
@@ Property / cites work: Probabilistic communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum communication complexity of symmetric predicates
+Normal rank
@@ Property / cites work @@
+A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
+Normal rank
@@ Property / cites work @@
+Halfspace matrices
@@ Property / cites work: Halfspace matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
+Normal rank
@@ Property / cites work @@
+Nondeterministic Quantum Query and Communication Complexities
+Normal rank
@@ Property / cites work @@
+On the Tightness of the Buhrman-Cleve-Wigderson Simulation
+Normal rank
@@ Property / DBLP publication ID @@
+journals/tcs/MontanaroNR11
@@ Property / DBLP publication ID: journals/tcs/MontanaroNR11 / rank @@
+Normal rank