In summary, we have demonstrated two new algorithms for generating Conway polynomials, or more general sets of compatible polynomials, over finite fields. These ...
Oct 23, 1998 · We present two new algorithms for generating Conway polynomials that avoid the brute force search. We have implemented one of these algorithms ...
This work generalizes Conway polynomials and Bosma--Cannon--Steel lattices by leveraging the theory of the Lenstra-Allombert isomorphism algorithm.
Conway polynomials are used in computational algebra systems such as GAP and Magma to represent finite fields. The generation of the Conway polynomials for a ...
Oct 22, 2024 · Request PDF | On Jan 1, 2004, Lenwood S. Heath and others published New algorithms for generating Conway polynomials over finite fields ...
New Algorithms for Generating Conway Polynomials over Finite Fields · On Alexander-Conway polynomials of two-bridge links. We consider Conway polynomials of two- ...
Dec 7, 2012 · Lenwood S. Heath, Nicholas A. Loehr: New Algorithms for Generating Conway Polynomials Over Finite Fields. SODA 1999: 429-437.
L.S.Heath and N.A.Loehr, New algorithms for generating Conway polynomials over finite fields, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete ...
"New algorithms for generating Conway polynomials over finite fields". Virginia Polytechnic Institute and State University. Technical Report ncstrl ...
Loehr, New algorithms for generating Conway polynomials over finite fields, Journal of Symbolic Computation, Volume 38, Issue 2, 2004, Pages 1003-1024 ...
People also ask
What is an example of a finite field irreducible polynomial?
What is the distinct degree factorization algorithm?