Hardness of Approximate Hypergraph Coloring.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/GuruswamiHS00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuruswamiHS00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Johan_H%E2%88%9A%E2%80%A2stad
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Madhu_Sudan_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Venkatesan_Guruswami
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892074
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.2000.892074
>
dc:
identifier
DBLP conf/focs/GuruswamiHS00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.2000.892074
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
Hardness of Approximate Hypergraph Coloring.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Johan_H%E2%88%9A%E2%80%A2stad
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Madhu_Sudan_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Venkatesan_Guruswami
>
swrc:
pages
149-158
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/GuruswamiHS00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/GuruswamiHS00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs2000.html#GuruswamiHS00
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.2000.892074
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
computational complexity; minimisation; graph colouring; computational geometry; hardness; approximate hypergraph coloring; covering complexity; probabilistic verifier; minimization problems; PCP verifier; 2-colorable 4-uniform hypergraph; hardness assumption
(xsd:string)
dc:
title
Hardness of Approximate Hypergraph Coloring.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document