[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/coco/Melkebeek96>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Dieter_van_Melkebeek>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FCCC.1996.507672>
foaf:homepage <https://doi.org/10.1109/CCC.1996.507672>
dc:identifier DBLP conf/coco/Melkebeek96 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FCCC.1996.507672 (xsd:string)
dcterms:issued 1996 (xsd:gYear)
rdfs:label Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Dieter_van_Melkebeek>
swrc:pages 88-96 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/coco/1996>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/coco/Melkebeek96/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/coco/Melkebeek96>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/coco/coco96.html#Melkebeek96>
rdfs:seeAlso <https://doi.org/10.1109/CCC.1996.507672>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/coco>
dc:subject computational complexity theory, sparse hard set problem for P (xsd:string)
dc:title Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document