Log Depth Circuits For Division And Related Problems

Authors:
P. W. Beame;S. A. Cook;H. J. Hoover
Affiliations:
Department of Computer Science, University of Toronto;-;-
Venue:
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Year:
1984

Citing 0
Cited 4

Integer Division in Linear Time with Bounded Fan-In

IEEE Transactions on Computers
Parallelism and algorithms for algebraic manipulation: current work

ACM SIGSAM Bulletin
Star-Free Open Languages and Aperiodic Loops

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Parallel Pseudo-Random Number Generation

CRYPTO '85 Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present optimal depth Boolean circuits (depth O(log n)) for integer division, powering, and multiple products. We also show that these three problems are of equivalent uniform depth and space complexity. In addition, we describe an algorithm for testing divisibility that is optimal for both depth and space.