29 citations · 162 across the 50 of their papers we have counts for
Showing 2019 · cs.LOShow all
2 papers · 2 filters
cs.LO2019
Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)
Libor Barto, Michael Pinsker
The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated that such CSPs are solvable in polynomial time whenever there is no natural reduction,…
cs.LO2019★ 5 cited
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
Manuel Bodirsky, Antoine Mottet, Miroslav Olšák +3
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial…