Using the results of a former paper of two of the authors, for certain subclasses of quantified Boolean formulas it is shown, that the evalution problem is coNP-complete. These subclasses can be seen as extensions of Horn and 2-CNF formulas.\\ Further it is shown that the evalution problem for quantified Boolean formulas remains PSPACE-complete, even if at most one universal variable is allowed in each clause.