We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reductions showing that the inversion of geometric distortions is computationally intractable.