An algorithm for constructing A-annihilated admissible monomials in the Dyer-Lashof algebra.

We present an algorithm for computing A-annihilated elements of the form Q^I [1] in H*QS⁰ where I runs through admissible sequences of positive excess. This is an algorithm with polynomial time complexity to address a sub-problem of an unsolved problem in algebraic topology known as the hit problem of Peterson which is likely to be NP-hard. [ABSTRACT FROM AUTHOR]