Optimal algorithms and inapproximability results for every CSP? | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Raghavendra08>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Prasad_Raghavendra>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F1374376.1374414>
foaf:homepage	<https://doi.org/10.1145/1374376.1374414>
dc:identifier	DBLP conf/stoc/Raghavendra08 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F1374376.1374414 (xsd:string)
dcterms:issued	2008 (xsd:gYear)
rdfs:label	Optimal algorithms and inapproximability results for every CSP? (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Prasad_Raghavendra>
swrc:pages	245-254 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2008>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/stoc/Raghavendra08/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/stoc/Raghavendra08>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/stoc/stoc2008.html#Raghavendra08>
rdfs:seeAlso	<https://doi.org/10.1145/1374376.1374414>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/stoc>
dc:subject	constraint satisfaction problem, dictatorship tests, rounding schemes, semidefinite programming, unique games conjecture (xsd:string)
dc:title	Optimal algorithms and inapproximability results for every CSP? (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document