DBpedia – Linked Data Fragments
DBpedia 2016-04
Query DBpedia 2016-04 by triple pattern
subject
predicate
object
Matches in DBpedia 2016-04 for
{ ?s ?p "The quantum query complexity of the hidden subgroup problem is polynomial" }
Showing triples 1 to 1 of
1
with
100
triples per page.
8b9e1e9dfd484e39d292dae8dc7197b4d43562ab65615389454f3d17b58a6ac8
title
"
The quantum query complexity of the hidden subgroup problem is polynomial
"
.
