On the complexity of the approximate hypergraph homomorphism problem