On rank vs. communication complexity (Q1906852): Difference between revisions

@@ Property / describes a project that uses @@
+GRAFFITI
@@ Property / describes a project that uses: GRAFFITI / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A counterexample to the rank-coloring conjecture
@@ Property / cites work: A counterexample to the rank-coloring conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q3197865
@@ Property / cites work: Q3197865 / rank @@
+Normal rank
@@ Property / cites work @@
+A Bound for the Chromatic Number of a Graph
@@ Property / cites work: A Bound for the Chromatic Number of a Graph / rank @@
+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 @@
+The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01192527
+Normal rank
@@ Property / OpenAlex ID @@
+W2175167577
@@ Property / OpenAlex ID: W2175167577 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1906852