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 "A 222pn Upper Bound on the Complexity of Presburger Arithmetic" }
Showing triples 1 to 1 of
1
with
100
triples per page.
0022-0000(78)90021-1
title
"
A 222pn Upper Bound on the Complexity of Presburger Arithmetic
"
.
