Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q15
@@ Property / Mathematics Subject Classification ID: 68Q15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6018497
@@ Property / zbMATH DE Number: 6018497 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+direct sum
@@ Property / zbMATH Keywords: direct sum / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+decision tree complexity
@@ Property / zbMATH Keywords: decision tree complexity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1523387560
@@ Property / OpenAlex ID: W1523387560 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0105
@@ Property / arXiv ID: 1004.0105 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58040211
@@ Property / Wikidata QID: Q58040211 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3172424
@@ Property / cites work: Q3172424 / rank @@
+Normal rank
@@ Property / cites work @@
+A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
+Normal rank
@@ Property / cites work @@
+Decision trees with Boolean threshold queries
@@ Property / cites work: Decision trees with Boolean threshold queries / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Robust polynomials and quantum algorithms
@@ Property / cites work: Robust polynomials and quantum algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Improved direct product theorems for randomized query complexity
+Normal rank
@@ Property / cites work @@
+Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
+Normal rank
@@ Property / cites work @@
+Products and Help Bits in Decision Trees
@@ Property / cites work: Products and Help Bits in Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
+Normal rank
@@ Property / cites work @@
+Q5365063
@@ Property / cites work: Q5365063 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:407594