On the ``log rank''-conjecture in communication complexity (Q1906853): Difference between revisions

@@ Property / Wikidata QID @@
+Q122964261
@@ Property / Wikidata QID: Q122964261 / 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 @@
+Whitney Number Inequalities for Geometric Lattices
+Normal rank
@@ Property / cites work @@
+Communication complexity and combinatorial lattice theory
+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 / cites work @@
+Q4001520
@@ Property / cites work: Q4001520 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01192528
+Normal rank
@@ Property / OpenAlex ID @@
+W2174446922
@@ Property / OpenAlex ID: W2174446922 / rank @@
+Normal rank