24 citations · 51 across the 16 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011★ 2 cited
CSP for binary conservative relational structures
Alexandr Kazda
We prove that whenever A is a 3-conservative relational structure with only binary and unary relations then the algebra of polymorphisms of A either has no Taylor operation (i.e. C…
math.CO2011
Complexity of the homomorphism extension problem in the random case
Alexandr Kazda
We prove that if A is a large random relational structure with at least one relation of arity at least 2 then the problem EXT(A) is almost surely NP-complete.