Random graphs and the parity quantifier
Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC ’09
Journal of the ACM
Phokion G. Kolaitis
Degree lower bounds of tower-type for approximating formulas with parity quantifiers