FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W2401679980
title
"
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.
"
@default
.
