A combinatorial approach to complexity (Q1196691): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the Shannon capacity of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vector representations of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic communication complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of matrix methods to the theory of lower bounds in computational complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometrical embeddings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embeddings of graphs in Euclidean spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds for Approximation by Nonlinear Manifolds / rank | |||
Normal rank |
Revision as of 14:04, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial approach to complexity |
scientific article |
Statements
A combinatorial approach to complexity (English)
0 references
16 January 1993
0 references
0 references