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.
['Paul Beame', 'Stephen A. Cook', 'H.J. Hoover']
Log Depth Circuits For Division And Related Problems