15 citations · 47 across the 12 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DB2017
The tractability frontier of well-designed SPARQL queries
Miguel Romero
We study the complexity of query evaluation of SPARQL queries. We focus on the fundamental fragment of well-designed SPARQL restricted to the AND, OPTIONAL and UNION operators. Our…
cs.CC2017★ 4 cited
The complexity of general-valued CSPs seen from the other side
Clement Carbonnel, Miguel Romero, Stanislav Zivny
The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau, Kolaiti…