Our algorithm is deterministic, and it runs in polynomial time for fields of small characteristic. We in fact prove the stronger result that the problem of finding irreducible polynomials of specified ...

This paper surveys models and algorithms dealing with partially observable Markov decision processes. A partially observable Markov decision process (POMDP) is a generalization of a Markov decision ...

Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and coding theory to symbolic ...