On the black-box complexity of Sperner's Lemma (Q839637): Difference between revisions

@@ Property / DOI @@
-.1007/s00224-008-9121-2
@@ Property / DOI: 10.1007/s00224-008-9121-2 / rank @@
-Normal rank
@@ Property / cites work @@
+Lower Bounds for Local Search by Quantum Arguments
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds for the collision and the element distinctness problems
+Normal rank
@@ Property / cites work @@
+Polynomial degree vs. quantum query complexity
@@ Property / cites work: Polynomial degree vs. quantum query complexity / 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 @@
+The relative complexity of NP search problems
@@ Property / cites work: The relative complexity of NP search problems / rank @@
+Normal rank
@@ Property / cites work @@
+Strengths and Weaknesses of Quantum Computing
@@ Property / cites work: Strengths and Weaknesses of Quantum Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Mod 2 degree and a generalized No Retraction Theorem
+Normal rank
@@ Property / cites work @@
+On the Complexity of 2D Discrete Fixed Point Problem
+Normal rank
@@ Property / cites work @@
+Quantum Separation of Local Search and Fixed Point Computation
+Normal rank
@@ Property / cites work @@
+Sperner's lemma and robust machines
@@ Property / cites work: Sperner's lemma and robust machines / 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 @@
+Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
+Normal rank
@@ Property / cites work @@
+A separator theorem for graphs of bounded genus
@@ Property / cites work: A separator theorem for graphs of bounded genus / rank @@
+Normal rank
@@ Property / cites work @@
+A Sperner lemma complete for PPA
@@ Property / cites work: A Sperner lemma complete for PPA / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
+Normal rank
@@ Property / cites work @@
+Dividing and conquering the square
@@ Property / cites work: Dividing and conquering the square / rank @@
+Normal rank
@@ Property / cites work @@
+Local optimization on graphs
@@ Property / cites work: Local optimization on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Quantum and classical query complexities of local search are polynomially related
+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 @@
+Q3002763
@@ Property / cites work: Q3002763 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles and Uniquely Edge Colourable Graphs
+Normal rank
@@ Property / DOI @@
+.1007/S00224-008-9121-2
@@ Property / DOI: 10.1007/S00224-008-9121-2 / rank @@
+Normal rank