Vikraman Arvind, Piyush P. Kurur. Upper Bounds on the Complexity of Some Galois Theory Problems. In Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono, editors, Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Volume 2906 of Lecture Notes in Computer Science, pages 716-725, Springer, 2003. [doi]
Abstract is missing.