AboutPartnersSign inJoin
Vinod G. J. Peris, University of Maryland at College Park. Department of Computer Science, A. Y. Oruc, M. Yaman Oruç
Fast Modular Arithmetic on a Permutation Network
Preliminary Version

Fast Modular Arithmetic on a Permutation Network Preliminary Version

Vinod G. J. Peris, University of Maryland at College Park. Department of Computer Science, A. Y. Oruc, M. Yaman Oruç — 1990
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]."
Sign up to use

This book appears on the shelf Series boxsets

Photo of Nicola Sarah Brooks
Nicola Sarah Brooks@nikkisbooknook
New Beginnings
New Beginnings by A. K. Michaels
Inferno
Inferno by Rachel Grant
Sam's Surrender
Sam's Surrender by Elle James
Manu
Manu by Anna Hackett
Everspell
Everspell by Donna Grant
A Highlander's Return
A Highlander's Return by A. K. Michaels