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 38] given relational structure R admits a weak near unanimity polymorphism is polynomial time solvable .