Before revision:  This includes deciding if a specific bank is at risk of default and deciding if a clearing vector exists in the first place. Second, we show thatcomputing an approximate solution to the clearing problem with sufficiently small constant error is PPAD-complete  .
After revision:  This remains true if we relax the problem to \varepsilon-approximate solutions, for a constant \varepsilon. We further show that, under sufficient conditions where a solution is guaranteed to exist, the approximate search problem is PPAD-complete .