Proof Verification and Hardness of Approximation Problems
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/AroraLMSS92
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/AroraLMSS92
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Carsten_Lund
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Madhu_Sudan_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mario_Szegedy
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rajeev_Motwani_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Arora
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1992.267823
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1992.267823
>
dc:
identifier
DBLP conf/focs/AroraLMSS92
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1992.267823
(xsd:string)
dcterms:
issued
1992
(xsd:gYear)
rdfs:
label
Proof Verification and Hardness of Approximation Problems
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Carsten_Lund
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Madhu_Sudan_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mario_Szegedy
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rajeev_Motwani_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Arora
>
swrc:
pages
14-23
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS33
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/books/crc/CRCcompiler2002/Gopinath02
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/AroraLMSS92/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/AroraLMSS92
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs92.html#AroraLMSS92
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1992.267823
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
MAX-CUT, proof verification, time complexity, approximation problems, polynomial-time probabilistic oracle machine, random bits, NP, MAXSNP-hard, metric TSP, MAX-SAT
(xsd:string)
dc:
title
Proof Verification and Hardness of Approximation Problems
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document