FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p Combination can be hard: approximability of the unique coverage problem ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W2010996873
title
"
Combination can be hard: approximability of the unique coverage problem
"
@default
.
