[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/wg/HemaspaandraRS02>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Edith_Hemaspaandra>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Holger_Spakowski>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%E2%88%82rg_Rothe>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-36379-3%5F23>
foaf:homepage <https://doi.org/10.1007/3-540-36379-3_23>
dc:identifier DBLP conf/wg/HemaspaandraRS02 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-36379-3%5F23 (xsd:string)
dcterms:issued 2002 (xsd:gYear)
rdfs:label Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Edith_Hemaspaandra>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Holger_Spakowski>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%E2%88%82rg_Rothe>
swrc:pages 258-269 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/wg/2002>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/wg/HemaspaandraRS02/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/wg/HemaspaandraRS02>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/wg/wg2002.html#HemaspaandraRS02>
rdfs:seeAlso <https://doi.org/10.1007/3-540-36379-3_23>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/wg>
dc:subject Computational complexity; completeness; minimum vertex cover heuristics; approximation; parallel access to NP. (xsd:string)
dc:title Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document