Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
P.W. Beame , Department of Computer Science, University of Toronto
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.
P.W. Beame, H.J. Hoover, "Log Depth Circuits For Division And Related Problems", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 1-6, doi:10.1109/SFCS.1984.715894