Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816): Difference between revisions

@@ Property / cites work @@
+On read-once threshold formulae and their randomized decision tree complexity
+Normal rank
@@ Property / cites work @@
+Randomized vs. deterministic decision tree complexity for read-once Boolean functions
+Normal rank
@@ Property / cites work @@
+Two applications of information complexity
@@ Property / cites work: Two applications of information complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549690
@@ Property / cites work: Q3549690 / rank @@
+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