Hardness of Approximate Hypergraph Coloring
type: Item
instance of: scholarly article
title: Hardness of Approximate Hypergraph Coloring
zbMATH Open document ID: 1008.68052
DOI: 10.1137/S0097539700377165
author: Venkatesan Guruswami
author: Johan Hastad
author: Madhu Sudan
published in: SIAM Journal on Computing
publication date: 2002-09-29T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1808497
zbMATH Keywords: graph coloring
zbMATH Keywords: hypergraph coloring
zbMATH Keywords: hardness of approximations
zbMATH Keywords: PCP
zbMATH Keywords: covering PCP
zbMATH Keywords: set splitting
Wikidata QID: Q56958987
MaRDI profile type: Publication
DBLP publication ID: journals/siamcomp/GuruswamiHS02
description: scientific article