A combinatorial approach to complexity
- 1 June 1992
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 12 (2) , 221-226
- https://doi.org/10.1007/bf01204724
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Probabilistic Communication ComplexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Applications of matrix methods to the theory of lower bounds in computational complexityCombinatorica, 1990
- Vector representations of graphsDiscrete Mathematics, 1989
- Embeddings of graphs in euclidean spacesDiscrete & Computational Geometry, 1989
- Geometrical embeddings of graphsDiscrete Mathematics, 1989
- Graph complexityActa Informatica, 1988
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Lower bounds for approximation by nonlinear manifoldsTransactions of the American Mathematical Society, 1968