A combinatorial approach to complexity (Q1196691): Difference between revisions

@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Vector representations of graphs
@@ Property / cites work: Vector representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic communication complexity
@@ Property / cites work: Probabilistic communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of matrix methods to the theory of lower bounds in computational complexity
+Normal rank
@@ Property / cites work @@
+Geometrical embeddings of graphs
@@ Property / cites work: Geometrical embeddings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embeddings of graphs in Euclidean spaces
@@ Property / cites work: Embeddings of graphs in Euclidean spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Approximation by Nonlinear Manifolds
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01204724
+Normal rank
@@ Property / OpenAlex ID @@
+W1494958865
@@ Property / OpenAlex ID: W1494958865 / rank @@
+Normal rank