In this paper we prove that calculating the average covering tree value recently proposed as a single-valued solution of graph games is #P-complete.

We introduce in this chapter A generalization of the classical collineation of P n. The generalization allows for a certain degree of freedom in the local-ization of points in P n at the expense of using multiple m > 2 views. The degree of freedom per point is governed by an additional parameter 1 ≤ k < n which stands for the dimension of the subspace in which the indvidual points are allowed t...