  Using the theory of smooth approximations, we give a new and algebraic proof
that for any set F of finite tournaments, the problem of orienting a finite
graph whilst avoiding all members of F is either in P or NP-complete. We
characterize both cases by algebraic conditions.
