Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functionally) faulty. A set S of initially faulty elements is called deadly if it causes the entire network to become faulty according to the above rule. We show that finding a minimum deadly set is NP-hard for arbitrary directe...