Vinod G. J. Peris

University of Maryland at College Park. Department of Computer Science

A. Y. Oruc

M. Yaman Oruç

Abstract: "A theorem of Cayley states that every finite group is isomorphic to a permutation group. Based on this fact, this paper establishes that modulo addition, subtraction, multiplication, and division can be performed on a permutation network with O(log2m) inputs, O((log2m)log2log2m), cost and O(log2log2m), depth for all integers m; 1 [greater than or equal to] m [greater than or equal to] 2[superscript 24]."

M. Yaman Oruç

Books

Your next favorite book is out there