FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W3037701641
title
"
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes
"
@default
.
