Clique is Hard to Approximate Within n1-epsilon. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hastad96>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Johan_H%E2%88%9A%E2%80%A2stad>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1996.548522>
foaf:homepage	<https://doi.org/10.1109/SFCS.1996.548522>
dc:identifier	DBLP conf/focs/Hastad96 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FSFCS.1996.548522 (xsd:string)
dcterms:issued	1996 (xsd:gYear)
rdfs:label	Clique is Hard to Approximate Within n1-epsilon. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Johan_H%E2%88%9A%E2%80%A2stad>
swrc:pages	627-636 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/focs/1996>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/focs/Hastad96/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/focs/Hastad96>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/focs/focs96.html#Hastad96>
rdfs:seeAlso	<https://doi.org/10.1109/SFCS.1996.548522>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject	computational complexity; Max Clique approximation; polynomial time; proof system; amortized free bits; global function; local functions; local consistency conditions (xsd:string)
dc:title	Clique is Hard to Approximate Within n1-epsilon. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document