A fast algorithm to compute irreducible and primitive polynomials in finite fields J. RifàJ. Borrell OriginalPaper Pages: 13 - 20
Separating complexity classes related to bounded alternating ω-branching programs C. MeinelS. Waack OriginalPaper Pages: 21 - 39
Different local controls for graph relabeling systems I. LitovskyY. MétivierE. Sopena OriginalPaper Pages: 41 - 65