We show that a problem of deciding
whether a formula for a multivariate polynomial of n variables
over a finite field of characteristic 2 has degree n
when reduced modulo a certain Boolean ideal belongs to parityP.
When the formula is allowed to have
succinct representations as sums of monomials,
the problem becomes parityP-complete.