The communication complexity of enumeration, elimination, and selection (Q5956009): Difference between revisions

@@ Property / OpenAlex ID @@
+W2105010107
@@ Property / OpenAlex ID: W2105010107 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded queries to SAT and the Boolean hierarchy
@@ Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Terse, superterse, and verbose sets
@@ Property / cites work: Terse, superterse, and verbose sets / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup>
+Normal rank
@@ Property / cites work @@
+Q4542529
@@ Property / cites work: Q4542529 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximable sets
@@ Property / cites work: Approximable sets / rank @@
+Normal rank
@@ Property / cites work @@
+Quantifying the amount of verboseness
@@ Property / cites work: Quantifying the amount of verboseness / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+On the direct sum conjecture in the straight line model
+Normal rank
@@ Property / cites work @@
+Enumerative counting is hard
@@ Property / cites work: Enumerative counting is hard / rank @@
+Normal rank
@@ Property / cites work @@
+A note on enumerative counting
@@ Property / cites work: A note on enumerative counting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4075484
@@ Property / cites work: Q4075484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Communication Complexity
@@ Property / cites work: Amortized Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the direct sum conjecture
@@ Property / cites work: On the direct sum conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded queries in recursion theory
@@ Property / cites work: Bounded queries in recursion theory / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between communication complexity classes
+Normal rank
@@ Property / cites work @@
+Theory of semi-feasible algorithms
@@ Property / cites work: Theory of semi-feasible algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Semirecursive Sets and Positive Reducibility
@@ Property / cites work: Semirecursive Sets and Positive Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+Normal rank
@@ Property / cites work @@
+Super-logarithmic depth lower bounds via the direct sum in communication complexity
+Normal rank
@@ Property / cites work @@
+On self-reducibility and weak P-selectivity
@@ Property / cites work: On self-reducibility and weak P-selectivity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Beigel's cardinality conjecture
@@ Property / cites work: A proof of Beigel's cardinality conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+``Global'' graph problems tend to be intractable
@@ Property / cites work: ``Global'' graph problems tend to be intractable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035322
@@ Property / cites work: Q4035322 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity and combinatorial lattice theory
+Normal rank
@@ Property / cites work @@
+Homomorphieeigenschaften und mittlere Kantendichte von Graphen
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Membership Comparable Sets
@@ Property / cites work: Polynomial-Time Membership Comparable Sets / rank @@
+Normal rank
@@ Property / cites work @@
+A cardinality version of Beigel's nonspeedup theorem
+Normal rank
@@ Property / cites work @@
+Realizing Boolean functions on disjoint sets of variables
+Normal rank
@@ Property / cites work @@
+On the distributional complexity of disjointness
@@ Property / cites work: On the distributional complexity of disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the density of families of sets
@@ Property / cites work: On the density of families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank
@@ Property / cites work @@
+Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
+Normal rank
@@ Property / cites work @@
+Reductions on NP and p-selective sets
@@ Property / cites work: Reductions on NP and p-selective sets / rank @@
+Normal rank
@@ Property / cites work @@
+On membership comparable sets
@@ Property / cites work: On membership comparable sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4047029
@@ Property / cites work: Q4047029 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
+Normal rank