We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
Let Q() and Q() be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q() Q(). The algorithm is particularly efficient if the number of i...
Optimizing interconnection networks is a prime object in switching schemes. In this work the authors present a novel approach for obtaining a required channel arrangement in a mul...