The iterative nature of state feedback control approaches based on the addition of control places (in Petri net models), can give rise to redundancies in the added control. These redundancies are characterised as implicit places. In this paper we prove that deciding the implicitness of a place added to a live marked graph is of polynomial complexity.