12 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.LO2023
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes
Balder ten Cate, Víctor Dalmau, Jakub Opršal
A Datalog program can be viewed as a syntactic specification of a functor from database instances over some schema to database instances over another schema. The same holds more ge…
cs.CC2022★ 12 cited
An invitation to the promise constraint satisfaction problem
Andrei Krokhin, Jakub Opršal
The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. Afte…
cs.DM2014
Universal Lyndon Words
Arturo Carpi, Gabriele Fici, Stepan Holub +2
A word over an alphabet is a Lyndon word if there exists an order defined on for which is lexicographically smaller than all of its conjugates (other than itself).…