72 citations · 368 across the 79 of their papers we have counts for
Showing 2026 · cs.CCShow all
2 papers · 2 filters
cs.CC2026
Graph Homomorphisms and Universal Algebra
Manuel Bodirsky
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational co…
cs.CC2026
The complexity of finding coset-generating polymorphisms and the promise metaproblem
Manuel Bodirsky, Armin Weiß
We show that the metaproblem for coset-generating polymorphisms is NP-complete, answering a question of Chen and Larose: given a finite structure, the computational question is whe…