A Fast Algorithm to Test the Principality of Ideals

Using the LLL algorithm we develop a method by which one can test the principality of ideals in some bicyclic biquadratic elds. Moreover, we will show that this algorithm run, at most, in polynomial running time.