[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/RadhakrishnanSV00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jaikumar_Radhakrishnan>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Pranab_Sen>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Srinivasan_Venkatesh_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892143>
foaf:homepage <https://doi.org/10.1109/SFCS.2000.892143>
dc:identifier DBLP conf/focs/RadhakrishnanSV00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.2000.892143 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label The Quantum Complexity of Set Membership. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jaikumar_Radhakrishnan>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Pranab_Sen>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Srinivasan_Venkatesh_0001>
swrc:pages 554-562 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/RadhakrishnanSV00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/RadhakrishnanSV00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs2000.html#RadhakrishnanSV00>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.2000.892143>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject quantum computing; computational complexity; set theory; probes; linear algebra; query processing; quantum complexity; static set membership problem; bit table; query answering; lower bounds; upper bounds; quantum bit-probe model; black-box unitary transform; oracle calls; query algorithm; basis state superposition; space-probe tradeoff; linear algebra (xsd:string)
dc:title The Quantum Complexity of Set Membership. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document