The complexity of the Quantified Constraint Satisfaction Problem (QCSP) over any finite constraint language is either in ΠP2 or PSpace-complete.
