Abstract
Let L = Q [ α ] L={\mathbb {Q}} [\alpha ] be an abelian number field of prime degree q q , and let a a be a nonzero rational number. We describe an algorithm which takes as input a a and the minimal polynomial of α \alpha over Q {\mathbb {Q}} , and determines if a a is a norm of an element of L L . We show that, if we ignore the time needed to obtain a complete factorization of a a and a complete factorization of the discriminant of α \alpha , then the algorithm runs in time polynomial in the size of the input. As an application, we give an algorithm to test if a cyclic algebra A = ( E , σ , a ) A=( E, \sigma , a ) over Q {\mathbb {Q}} is a division algebra.

This publication has 12 references indexed in Scilit: