[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChoiK08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jeong_Han_Kim>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sung-Soon_Choi>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F1374376.1374484>
foaf:homepage <https://doi.org/10.1145/1374376.1374484>
dc:identifier DBLP conf/stoc/ChoiK08 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F1374376.1374484 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
rdfs:label Optimal query complexity bounds for finding graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jeong_Han_Kim>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sung-Soon_Choi>
swrc:pages 749-758 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2008>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/stoc/ChoiK08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/stoc/ChoiK08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/stoc/stoc2008.html#ChoiK08>
rdfs:seeAlso <https://doi.org/10.1145/1374376.1374484>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/stoc>
dc:subject coin weighing problem, combinatorial group testing, combinatorial search, fourier coefficient, graph finding, littlewood-offord theorem, pseudo-boolean function (xsd:string)
dc:title Optimal query complexity bounds for finding graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document