Quadratically tight relations for randomized query complexity (Q5915578): Difference between revisions

@@ Property / cites work @@
+Quantum certificate complexity
@@ Property / cites work: Quantum certificate complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Separations in query complexity using cheat sheets
+Normal rank
@@ Property / cites work @@
+Q5368738
@@ Property / cites work: Q5368738 / 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 @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Composition limits and separating examples for some Boolean function complexity measures
+Normal rank
@@ Property / cites work @@
+Q4598278
@@ Property / cites work: Q4598278 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3187177
@@ Property / cites work: Q3187177 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties and applications of boolean function composition
+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