The following pages link to Sebastian Skritek (Q389241):
Displaying 7 items.
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- The Challenge of Optional Matching in SPARQL (Q2807080) (← links)
- (Q5091134) (← links)
- On the Complexity of Enumerating the Answers to Well-designed Pattern Trees (Q5276203) (← links)
- Diversity of answers to conjunctive queries (Q6615182) (← links)