10 citations · 12 across the 11 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Descriptive complexity of controllable graphs
Aida Abiad, Anuj Dawar, Octavio Zapata
Let be a graph on vertices with adjacency matrix , and let be the all-ones vector. We call controllable if the set of vectors $\mathbf{1}, A\mathbf{1},…
cs.LO2023
Quantifiers closed under partial polymorphisms
Anuj Dawar, Lauri Hella
We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). W…