A combinatorial approach to complexity
type: Item
instance of: scholarly article
title: A combinatorial approach to complexity
zbMATH Open document ID: 0825.68483
DOI: 10.1007/BF01204724
author: Pavel Pudlák
author: Vojtěch Rödl
published in: Combinatorica
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 89346
MaRDI profile type: Publication
cites work: On the Shannon capacity of a graph
cites work: Vector representations of graphs
cites work: Probabilistic communication complexity
cites work: Applications of matrix methods to the theory of lower bounds in computational complexity
cites work: Geometrical embeddings of graphs
cites work: Embeddings of graphs in Euclidean spaces
cites work: Lower Bounds for Approximation by Nonlinear Manifolds
full work available at URL: https://doi.org/10.1007/bf01204724
OpenAlex ID: W1494958865
description: scientific article; zbMATH DE number 89346