Separation Between Deterministic and Randomized Query Complexity (Q5376437): Difference between revisions

@@ Property / cites work @@
+Separations in Query Complexity Based on Pointer Functions
+Normal rank
@@ Property / cites work @@
+Separations in query complexity using cheat sheets
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Probabilistic recurrence relations revisited
@@ Property / cites work: Probabilistic recurrence relations revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Concentration of Measure for the Analysis of Randomized Algorithms
+Normal rank
@@ Property / cites work @@
+Q5368739
@@ Property / cites work: Q5368739 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for the randomized decision tree Complexity of recursive majority
+Normal rank
@@ Property / cites work @@
+Inequalities: theory of majorization and its applications
+Normal rank
@@ Property / cites work @@
+Towards Better Separation between Deterministic and Randomized Query Complexity
+Normal rank
@@ Property / cites work @@
+CREW PRAM<scp>s</scp> and Decision Trees
@@ Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+The Zero-Error Randomized Query Complexity of the Pointer Function
+Normal rank
@@ Property / cites work @@
+On recognizing graph properties from adjacency matrices
+Normal rank
@@ Property / cites work @@
+Lower bounds on probabilistic linear decision trees
+Normal rank
@@ Property / cites work @@
+Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
+Normal rank