Before revision: We show that deciding whether a ]  given relational structure R admits a weak near unanimity polymorphism is polynomial time solvable .
After revision: We show that deciding whether a ] for recognition of Maltsev polymorphisms and decide in polynomial time if a given relational structure R admits a weak near unanimity polymorphism is polynomial time solvable .