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 ...

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 ...

The paper is devoted to the description and application of a new iterative mesh optimization algorithm for the finite element solution of variational problems set in infinite-dimensional spaces. The ...