Ordered biclique partitions and communication complexity problems (Q2342387): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963309684
@@ Property / OpenAlex ID: W2963309684 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6192
@@ Property / arXiv ID: 1311.6192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5688995
@@ Property / cites work: Q5688995 / rank @@
+Normal rank
@@ Property / cites work @@
+Some improved bounds on communication complexity via new decomposition of cliques
+Normal rank
@@ Property / cites work @@
+Clique versus independent set
@@ Property / cites work: Clique versus independent set / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of two lower-bound methods for communication complexity
+Normal rank
@@ Property / cites work @@
+Fooling-sets and rank
@@ Property / cites work: Fooling-sets and rank / rank @@
+Normal rank
@@ Property / cites work @@
+Q5663904
@@ Property / cites work: Q5663904 / rank @@
+Normal rank
@@ Property / cites work @@
+A counterexample to the Alon-Saks-Seymour conjecture and related problems
+Normal rank
@@ Property / cites work @@
+On covering graphs by complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+The linear-array conjecture in communication complexity is false
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of communication complexity
@@ Property / cites work: On the complexity of communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank